/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:34:37,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:34:37,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:34:37,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:34:37,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:34:37,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:34:37,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:34:37,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:34:37,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:34:37,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:34:37,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:34:37,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:34:37,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:34:37,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:34:37,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:34:37,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:34:37,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:34:37,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:34:37,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:34:37,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:34:37,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:34:37,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:34:37,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:34:37,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:34:37,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:34:37,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:34:37,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:34:37,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:34:37,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:34:37,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:34:37,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:34:37,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:34:37,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:34:37,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:34:37,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:34:37,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:34:37,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:34:37,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:34:37,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:34:37,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:34:37,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:34:37,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:34:37,561 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:34:37,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:34:37,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:34:37,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:34:37,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:34:37,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:34:37,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:34:37,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:34:37,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:34:37,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:34:37,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:34:37,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:34:37,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:34:37,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:34:37,570 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:34:37,570 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:34:37,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:34:37,570 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:34:37,570 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:34:37,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:34:37,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:34:37,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:34:37,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:34:37,784 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:34:37,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-08 08:34:37,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d27447d/f4e399996253441dbf3a5e0b2fc5c6ca/FLAG8d86b4b33 [2022-04-08 08:34:38,318 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:34:38,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-08 08:34:38,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d27447d/f4e399996253441dbf3a5e0b2fc5c6ca/FLAG8d86b4b33 [2022-04-08 08:34:38,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d27447d/f4e399996253441dbf3a5e0b2fc5c6ca [2022-04-08 08:34:38,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:34:38,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:34:38,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:34:38,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:34:38,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:34:38,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:34:38" (1/1) ... [2022-04-08 08:34:38,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fda46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:38, skipping insertion in model container [2022-04-08 08:34:38,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:34:38" (1/1) ... [2022-04-08 08:34:38,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:34:38,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:34:39,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c[65397,65410] [2022-04-08 08:34:39,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:34:39,217 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:34:39,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c[65397,65410] [2022-04-08 08:34:39,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:34:39,322 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:34:39,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39 WrapperNode [2022-04-08 08:34:39,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:34:39,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:34:39,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:34:39,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:34:39,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:34:39,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:34:39,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:34:39,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:34:39,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (1/1) ... [2022-04-08 08:34:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:34:39,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:34:39,499 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:34:39,520 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:34:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:34:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:34:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:34:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:34:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:34:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:34:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:34:39,688 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:34:39,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:34:40,878 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:34:41,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 08:34:41,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 08:34:41,250 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:34:41,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:34:41,255 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:34:41,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:34:41 BoogieIcfgContainer [2022-04-08 08:34:41,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:34:41,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:34:41,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:34:41,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:34:41,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:34:38" (1/3) ... [2022-04-08 08:34:41,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c1565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:34:41, skipping insertion in model container [2022-04-08 08:34:41,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:34:39" (2/3) ... [2022-04-08 08:34:41,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c1565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:34:41, skipping insertion in model container [2022-04-08 08:34:41,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:34:41" (3/3) ... [2022-04-08 08:34:41,265 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2022-04-08 08:34:41,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:34:41,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:34:41,306 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:34:41,317 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:34:41,317 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:34:41,336 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:34:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:34:41,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:41,343 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:34:41,344 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-08 08:34:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:41,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [174418138] [2022-04-08 08:34:41,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:34:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-08 08:34:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:41,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105802531] [2022-04-08 08:34:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:41,884 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:34:41,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 08:34:41,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 08:34:41,888 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:34:41,889 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:34:41,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 08:34:41,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 08:34:41,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-08 08:34:41,890 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:34:41,890 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:34:41,905 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:34:41,905 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:34:41,906 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:34:41,906 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:34:41,907 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:34:41,907 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:34:41,908 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:34:41,908 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:34:41,908 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:34:41,908 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:34:41,908 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:34:41,909 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:34:41,909 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:34:41,909 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:34:41,909 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:34:41,909 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:34:41,909 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:34:41,909 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:34:41,910 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:34:41,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-08 08:34:41,910 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:34:41,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-08 08:34:41,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-08 08:34:41,911 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:34:41,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:41,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105802531] [2022-04-08 08:34:41,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105802531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:41,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:41,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:41,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [174418138] [2022-04-08 08:34:41,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [174418138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:41,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:41,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986138373] [2022-04-08 08:34:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:41,920 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:34:41,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:41,924 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:34:41,956 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:34:41,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:41,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:41,980 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:34:44,029 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:34:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:45,137 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-08 08:34:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:45,138 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:34:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:45,139 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:34:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 08:34:45,159 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:34:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 08:34:45,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-08 08:34:45,509 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:34:45,517 INFO L225 Difference]: With dead ends: 267 [2022-04-08 08:34:45,517 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 08:34:45,519 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:34:45,521 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:34:45,522 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:34:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 08:34:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-08 08:34:45,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:45,557 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:34:45,559 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:34:45,559 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:34:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:45,567 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 08:34:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 08:34:45,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:45,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:45,568 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:34:45,569 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:34:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:45,576 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 08:34:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 08:34:45,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:45,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:45,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:45,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:45,582 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:34:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-08 08:34:45,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-08 08:34:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:45,587 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-08 08:34:45,587 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:34:45,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-08 08:34:45,717 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:34:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-08 08:34:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 08:34:45,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:45,719 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:34:45,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:34:45,719 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-08 08:34:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:45,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879336249] [2022-04-08 08:34:45,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-08 08:34:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:45,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783849349] [2022-04-08 08:34:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:45,983 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:34:45,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 08:34:45,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 08:34:45,984 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:34:45,985 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:34:45,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 08:34:45,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 08:34:45,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-08 08:34:45,986 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:34:45,986 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:34:45,986 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:34:45,987 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:34:45,987 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:34:45,987 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:34:45,988 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:34:45,990 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:34:45,992 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:34:45,992 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:34:45,993 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:34:45,993 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:34:45,993 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:34:45,994 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:34:45,994 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:34:45,994 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:34:45,995 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:34:45,995 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:34:45,995 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:34:45,996 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:34:45,996 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:34:45,997 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:34:45,997 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:34:45,997 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:34:45,998 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:34:45,998 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:34:45,999 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:34:45,999 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:34:45,999 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:34:46,000 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:34:46,000 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:34:46,000 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:34:46,001 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:34:46,001 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:34:46,001 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:34:46,002 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:34:46,002 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:34:46,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-08 08:34:46,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-08 08:34:46,003 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:34:46,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:46,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783849349] [2022-04-08 08:34:46,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783849349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:46,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:46,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:46,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:46,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879336249] [2022-04-08 08:34:46,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879336249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:46,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:46,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118523034] [2022-04-08 08:34:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:46,006 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:34:46,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:46,006 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:34:46,043 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:34:46,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:46,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:46,051 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:34:48,072 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:34:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:48,657 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-08 08:34:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:48,658 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:34:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:48,658 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:34:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 08:34:48,662 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:34:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 08:34:48,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-08 08:34:49,009 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:34:49,015 INFO L225 Difference]: With dead ends: 327 [2022-04-08 08:34:49,015 INFO L226 Difference]: Without dead ends: 222 [2022-04-08 08:34:49,015 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:34:49,016 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:34:49,016 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:34:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-08 08:34:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-08 08:34:49,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:49,035 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:34:49,038 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:34:49,038 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:34:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:49,046 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-08 08:34:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 08:34:49,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:49,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:49,047 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:34:49,047 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:34:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:49,053 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-08 08:34:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 08:34:49,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:49,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:49,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:49,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:49,054 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:34:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-08 08:34:49,061 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-08 08:34:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:49,062 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-08 08:34:49,062 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:34:49,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-08 08:34:49,298 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:34:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 08:34:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 08:34:49,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:49,299 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:34:49,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:34:49,300 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-08 08:34:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897391749] [2022-04-08 08:34:49,301 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-08 08:34:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:49,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292515861] [2022-04-08 08:34:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:49,517 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:34:49,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-08 08:34:49,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-08 08:34:49,518 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:34:49,518 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:34:49,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-08 08:34:49,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-08 08:34:49,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-08 08:34:49,518 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:34:49,518 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:34:49,519 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:34:49,519 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:34:49,519 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:34:49,519 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:34:49,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-08 08:34:49,519 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:34:49,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-08 08:34:49,519 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:34:49,520 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:34:49,520 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:34:49,520 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:34:49,520 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:34:49,520 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:34:49,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-08 08:34:49,522 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:34:49,522 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:34:49,522 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:34:49,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-08 08:34:49,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-08 08:34:49,523 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:34:49,524 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:34:49,524 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:34:49,525 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:34:49,531 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:34:49,531 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:34:49,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-08 08:34:49,532 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:34:49,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-08 08:34:49,533 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:34:49,533 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:34:49,534 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:34:49,534 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:34:49,535 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:34:49,535 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:34:49,535 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:34:49,536 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:34:49,536 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:34:49,536 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:34:49,537 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:34:49,537 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:34:49,538 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:34:49,538 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:34:49,538 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:34:49,538 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:34:49,539 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:34:49,539 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:34:49,539 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:34:49,539 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:34:49,539 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-08 08:34:49,539 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:34:49,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-08 08:34:49,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-08 08:34:49,540 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:34:49,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:49,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292515861] [2022-04-08 08:34:49,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292515861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:49,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:49,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:49,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:49,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897391749] [2022-04-08 08:34:49,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897391749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:49,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:49,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427572670] [2022-04-08 08:34:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:49,541 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:34:49,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:49,541 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:34:49,586 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:34:49,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:49,587 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:34:51,605 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:34:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:52,608 INFO L93 Difference]: Finished difference Result 363 states and 539 transitions. [2022-04-08 08:34:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:52,609 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:34:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:52,609 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:34:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-08 08:34:52,612 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:34:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-08 08:34:52,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-08 08:34:52,837 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:34:52,843 INFO L225 Difference]: With dead ends: 363 [2022-04-08 08:34:52,843 INFO L226 Difference]: Without dead ends: 258 [2022-04-08 08:34:52,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:52,854 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:52,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-08 08:34:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2022-04-08 08:34:52,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:52,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:52,870 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:52,870 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:52,879 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-08 08:34:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-08 08:34:52,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:52,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:52,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-08 08:34:52,881 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-08 08:34:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:52,886 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-08 08:34:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-08 08:34:52,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:52,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:52,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:52,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:52,887 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:34:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-08 08:34:52,893 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-08 08:34:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:52,893 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-08 08:34:52,893 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:34:52,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-08 08:34:53,077 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:34:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-08 08:34:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 08:34:53,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:53,080 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:34:53,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:34:53,080 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-08 08:34:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:53,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577485767] [2022-04-08 08:35:02,759 WARN L232 SmtUtils]: Spent 9.67s 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:35:10,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:35:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-08 08:35:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:35:10,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264697845] [2022-04-08 08:35:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:35:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:35:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:35:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:10,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4458#true} is VALID [2022-04-08 08:35:10,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 08:35:10,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:35:10,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret158 := main(); {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {4458#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {4458#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {4458#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {4458#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {4458#true} assume 12292 == #t~mem49;havoc #t~mem49; {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {4458#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {4458#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {4458#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {4458#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {4458#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4458#true} is VALID [2022-04-08 08:35:10,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {4458#true} assume !(0 == ~tmp___4~0); {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {4458#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {4458#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {4458#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {4458#true} ~skip~0 := 0; {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {4458#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {4458#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {4458#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-08 08:35:10,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {4458#true} assume 4368 == #t~mem54;havoc #t~mem54; {4458#true} is VALID [2022-04-08 08:35:10,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {4458#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4458#true} is VALID [2022-04-08 08:35:10,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {4458#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4458#true} is VALID [2022-04-08 08:35:10,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {4458#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:10,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:10,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:10,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:10,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:10,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:10,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-08 08:35:10,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4459#false} is VALID [2022-04-08 08:35:10,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {4459#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4459#false} is VALID [2022-04-08 08:35:10,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {4459#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {4459#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4459#false} is VALID [2022-04-08 08:35:10,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {4459#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {4459#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {4459#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !(0 == ~tmp___4~0); {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {4459#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {4459#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {4459#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {4459#false} ~skip~0 := 0; {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-08 08:35:10,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {4459#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {4459#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {4459#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {4459#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {4459#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 63: Hoare triple {4459#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {4459#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {4459#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {4459#false} assume 4432 == #t~mem62;havoc #t~mem62; {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 70: Hoare triple {4459#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 71: Hoare triple {4459#false} assume 5 == ~blastFlag~0; {4459#false} is VALID [2022-04-08 08:35:10,909 INFO L290 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-08 08:35:10,910 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:35:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:35:10,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264697845] [2022-04-08 08:35:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264697845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:10,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:10,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:35:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [577485767] [2022-04-08 08:35:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [577485767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:10,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981800920] [2022-04-08 08:35:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:35:10,913 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:35:10,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:35:10,914 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:35:10,966 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:35:10,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:35:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:10,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:35:10,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:35:10,967 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:35:12,990 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:35:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:13,942 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-08 08:35:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:35:13,943 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:35:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:35:13,943 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:35:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:35:13,947 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:35:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:35:13,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:35:14,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:14,308 INFO L225 Difference]: With dead ends: 645 [2022-04-08 08:35:14,308 INFO L226 Difference]: Without dead ends: 421 [2022-04-08 08:35:14,310 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:35:14,311 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:35:14,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:35:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-08 08:35:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-08 08:35:14,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:35:14,357 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:35:14,357 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:35:14,358 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:35:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:14,367 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-08 08:35:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-08 08:35:14,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:14,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:14,369 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:35:14,369 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:35:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:14,383 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-08 08:35:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-08 08:35:14,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:14,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:14,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:35:14,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:35:14,384 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:35:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-08 08:35:14,389 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-08 08:35:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:35:14,389 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-08 08:35:14,389 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:35:14,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-08 08:35:14,688 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:35:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-08 08:35:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 08:35:14,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:35:14,689 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:35:14,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:35:14,690 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:35:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:35:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-08 08:35:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:14,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046037476] [2022-04-08 08:35:28,654 WARN L232 SmtUtils]: Spent 9.89s 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:35:36,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:35:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-08 08:35:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:35:36,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111538922] [2022-04-08 08:35:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:35:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:35:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:35:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:37,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7126#true} is VALID [2022-04-08 08:35:37,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-08 08:35:37,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-08 08:35:37,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {7126#true} call ULTIMATE.init(); {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:35:37,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7126#true} is VALID [2022-04-08 08:35:37,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-08 08:35:37,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-08 08:35:37,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {7126#true} call #t~ret158 := main(); {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {7126#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {7126#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {7126#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {7126#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {7126#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {7126#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-08 08:35:37,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {7126#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {7126#true} assume 12292 == #t~mem49;havoc #t~mem49; {7126#true} is VALID [2022-04-08 08:35:37,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {7126#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7126#true} is VALID [2022-04-08 08:35:37,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {7126#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {7126#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7126#true} is VALID [2022-04-08 08:35:37,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {7126#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {7126#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {7126#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7126#true} is VALID [2022-04-08 08:35:37,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {7126#true} assume !(0 == ~tmp___4~0); {7126#true} is VALID [2022-04-08 08:35:37,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {7126#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {7126#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {7126#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7126#true} is VALID [2022-04-08 08:35:37,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {7126#true} ~skip~0 := 0; {7126#true} is VALID [2022-04-08 08:35:37,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-08 08:35:37,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {7126#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {7126#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {7126#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {7126#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {7126#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {7126#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-08 08:35:37,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {7126#true} assume 4368 == #t~mem54;havoc #t~mem54; {7126#true} is VALID [2022-04-08 08:35:37,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {7126#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7126#true} is VALID [2022-04-08 08:35:37,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {7126#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7126#true} is VALID [2022-04-08 08:35:37,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {7126#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:37,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7132#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {7132#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {7127#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {7127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {7127#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {7127#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {7127#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {7127#false} assume !(0 == ~tmp___4~0); {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {7127#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {7127#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {7127#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#false} ~skip~0 := 0; {7127#false} is VALID [2022-04-08 08:35:37,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {7127#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {7127#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {7127#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {7127#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {7127#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 61: Hoare triple {7127#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 62: Hoare triple {7127#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 63: Hoare triple {7127#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 64: Hoare triple {7127#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {7127#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-08 08:35:37,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {7127#false} assume 4432 == #t~mem62;havoc #t~mem62; {7127#false} is VALID [2022-04-08 08:35:37,092 INFO L290 TraceCheckUtils]: 70: Hoare triple {7127#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7127#false} is VALID [2022-04-08 08:35:37,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {7127#false} assume 5 == ~blastFlag~0; {7127#false} is VALID [2022-04-08 08:35:37,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-08 08:35:37,092 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:35:37,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:35:37,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111538922] [2022-04-08 08:35:37,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111538922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:37,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:37,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:37,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:35:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046037476] [2022-04-08 08:35:37,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046037476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:37,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:37,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657525313] [2022-04-08 08:35:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:35:37,093 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:35:37,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:35:37,094 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:35:37,147 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:35:37,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:35:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:35:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:35:37,148 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:35:39,171 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:35:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:40,135 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-08 08:35:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:35:40,135 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:35:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:35:40,135 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:35:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:35:40,138 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:35:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:35:40,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:35:40,466 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:35:40,475 INFO L225 Difference]: With dead ends: 668 [2022-04-08 08:35:40,475 INFO L226 Difference]: Without dead ends: 422 [2022-04-08 08:35:40,476 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:35:40,476 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:35:40,477 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:35:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-08 08:35:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-08 08:35:40,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:35:40,487 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:35:40,487 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:35:40,488 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:35:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:40,495 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-08 08:35:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-08 08:35:40,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:40,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:40,497 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:35:40,497 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:35:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:40,505 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-08 08:35:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-08 08:35:40,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:40,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:40,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:35:40,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:35:40,506 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:35:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-08 08:35:40,510 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-08 08:35:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:35:40,510 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-08 08:35:40,510 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:35:40,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-08 08:35:40,810 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:35:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-08 08:35:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 08:35:40,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:35:40,812 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:35:40,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:35:40,812 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:35:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:35:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-08 08:35:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192369593] [2022-04-08 08:35:53,847 WARN L232 SmtUtils]: Spent 13.03s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:36:05,984 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:05,985 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-08 08:36:05,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:05,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295403672] [2022-04-08 08:36:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:06,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9846#true} is VALID [2022-04-08 08:36:06,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-08 08:36:06,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-08 08:36:06,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {9846#true} call ULTIMATE.init(); {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:36:06,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9846#true} is VALID [2022-04-08 08:36:06,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-08 08:36:06,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-08 08:36:06,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {9846#true} call #t~ret158 := main(); {9846#true} is VALID [2022-04-08 08:36:06,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {9846#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9846#true} is VALID [2022-04-08 08:36:06,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {9846#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9846#true} is VALID [2022-04-08 08:36:06,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {9846#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {9846#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9846#true} is VALID [2022-04-08 08:36:06,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {9846#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {9846#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {9846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {9846#true} assume 12292 == #t~mem49;havoc #t~mem49; {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {9846#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {9846#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {9846#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {9846#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {9846#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {9846#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {9846#true} assume !(0 == ~tmp___4~0); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {9846#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {9846#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {9846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {9846#true} ~skip~0 := 0; {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {9846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {9846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {9846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {9846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {9846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {9846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {9846#true} assume 4368 == #t~mem54;havoc #t~mem54; {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {9846#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9846#true} is VALID [2022-04-08 08:36:06,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {9846#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9846#true} is VALID [2022-04-08 08:36:06,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {9846#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:06,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9852#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {9852#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {9847#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {9847#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {9847#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {9847#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {9847#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {9847#false} assume !(0 == ~tmp___4~0); {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {9847#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {9847#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {9847#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {9847#false} ~skip~0 := 0; {9847#false} is VALID [2022-04-08 08:36:06,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {9847#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {9847#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {9847#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {9847#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {9847#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {9847#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {9847#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {9847#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {9847#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {9847#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {9847#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {9847#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {9847#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {9847#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-08 08:36:06,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {9847#false} assume 4432 == #t~mem62;havoc #t~mem62; {9847#false} is VALID [2022-04-08 08:36:06,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {9847#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9847#false} is VALID [2022-04-08 08:36:06,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {9847#false} assume 5 == ~blastFlag~0; {9847#false} is VALID [2022-04-08 08:36:06,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-08 08:36:06,174 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:36:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:06,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295403672] [2022-04-08 08:36:06,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295403672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:06,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:06,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:06,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:06,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192369593] [2022-04-08 08:36:06,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192369593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:06,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:06,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:06,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198733566] [2022-04-08 08:36:06,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:06,175 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:36:06,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:06,176 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:36:06,231 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:36:06,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:06,231 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:36:08,251 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:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:09,281 INFO L93 Difference]: Finished difference Result 416 states and 614 transitions. [2022-04-08 08:36:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:09,281 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:36:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:09,281 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:36:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-08 08:36:09,284 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:36:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-08 08:36:09,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-08 08:36:09,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:09,541 INFO L225 Difference]: With dead ends: 416 [2022-04-08 08:36:09,541 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 08:36:09,542 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:09,542 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:36:09,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 482 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:36:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 08:36:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-08 08:36:09,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:09,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:09,551 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:09,551 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:09,555 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-08 08:36:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-08 08:36:09,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:09,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:09,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 08:36:09,556 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 08:36:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:09,560 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-08 08:36:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-08 08:36:09,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:09,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:09,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:09,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:09,561 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:36:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-08 08:36:09,565 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-08 08:36:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:09,565 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-08 08:36:09,565 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:36:09,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-08 08:36:09,872 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:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-08 08:36:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 08:36:09,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:09,873 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:36:09,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:36:09,873 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-08 08:36:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:09,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799257610] [2022-04-08 08:36:27,296 WARN L232 SmtUtils]: Spent 13.18s 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:35,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-08 08:36:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:35,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916529905] [2022-04-08 08:36:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:35,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11780#true} is VALID [2022-04-08 08:36:35,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-08 08:36:35,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-08 08:36:35,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {11780#true} call ULTIMATE.init(); {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:36:35,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11780#true} is VALID [2022-04-08 08:36:35,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-08 08:36:35,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-08 08:36:35,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {11780#true} call #t~ret158 := main(); {11780#true} is VALID [2022-04-08 08:36:35,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {11780#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L272 TraceCheckUtils]: 6: Hoare triple {11780#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {11780#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {11780#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {11780#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {11780#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {11780#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {11780#true} assume 12292 == #t~mem49;havoc #t~mem49; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {11780#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {11780#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {11780#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {11780#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {11780#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {11780#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {11780#true} assume !(0 == ~tmp___4~0); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {11780#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {11780#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {11780#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {11780#true} ~skip~0 := 0; {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {11780#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {11780#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {11780#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {11780#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {11780#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {11780#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-08 08:36:35,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {11780#true} assume 4368 == #t~mem54;havoc #t~mem54; {11780#true} is VALID [2022-04-08 08:36:35,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {11780#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11780#true} is VALID [2022-04-08 08:36:35,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {11780#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11780#true} is VALID [2022-04-08 08:36:35,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {11780#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:35,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11786#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {11786#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11781#false} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {11781#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {11781#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11781#false} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {11781#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {11781#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {11781#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11781#false} is VALID [2022-04-08 08:36:35,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {11781#false} assume !(0 == ~tmp___4~0); {11781#false} is VALID [2022-04-08 08:36:35,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {11781#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {11781#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {11781#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11781#false} is VALID [2022-04-08 08:36:35,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {11781#false} ~skip~0 := 0; {11781#false} is VALID [2022-04-08 08:36:35,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-08 08:36:35,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {11781#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {11781#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {11781#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 60: Hoare triple {11781#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {11781#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {11781#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {11781#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {11781#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {11781#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 66: Hoare triple {11781#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 67: Hoare triple {11781#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 68: Hoare triple {11781#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 69: Hoare triple {11781#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {11781#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-08 08:36:35,612 INFO L290 TraceCheckUtils]: 71: Hoare triple {11781#false} assume 4432 == #t~mem62;havoc #t~mem62; {11781#false} is VALID [2022-04-08 08:36:35,612 INFO L290 TraceCheckUtils]: 72: Hoare triple {11781#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11781#false} is VALID [2022-04-08 08:36:35,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {11781#false} assume 5 == ~blastFlag~0; {11781#false} is VALID [2022-04-08 08:36:35,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-08 08:36:35,613 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:36:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:35,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916529905] [2022-04-08 08:36:35,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916529905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:35,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:35,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:35,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799257610] [2022-04-08 08:36:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799257610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393870298] [2022-04-08 08:36:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:35,615 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:36:35,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:35,615 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:36:35,682 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:36:35,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:35,683 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:36:37,709 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:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:38,602 INFO L93 Difference]: Finished difference Result 416 states and 612 transitions. [2022-04-08 08:36:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:38,602 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:36:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:38,603 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:36:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-08 08:36:38,605 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:36:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-08 08:36:38,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-08 08:36:38,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:38,859 INFO L225 Difference]: With dead ends: 416 [2022-04-08 08:36:38,859 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 08:36:38,859 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:38,860 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:36:38,860 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:36:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 08:36:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-08 08:36:38,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:38,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:38,869 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:38,869 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:38,873 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-08 08:36:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-08 08:36:38,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:38,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:38,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 08:36:38,875 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 08:36:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:38,879 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-08 08:36:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-08 08:36:38,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:38,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:38,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:38,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:38,880 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:36:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-08 08:36:38,884 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-08 08:36:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:38,884 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-08 08:36:38,884 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:36:38,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-08 08:36:39,182 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:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-08 08:36:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 08:36:39,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:39,183 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:36:39,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:36:39,183 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:39,183 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-08 08:36:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:39,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311669639] [2022-04-08 08:36:52,676 WARN L232 SmtUtils]: Spent 9.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:36:59,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-08 08:36:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:59,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247484443] [2022-04-08 08:36:59,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:59,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:59,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13714#true} is VALID [2022-04-08 08:36:59,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-08 08:36:59,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {13714#true} call ULTIMATE.init(); {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:36:59,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {13714#true} call #t~ret158 := main(); {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {13714#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {13714#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {13714#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {13714#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {13714#true} is VALID [2022-04-08 08:36:59,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {13714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {13714#true} assume 12292 == #t~mem49;havoc #t~mem49; {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {13714#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {13714#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {13714#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {13714#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {13714#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {13714#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {13714#true} assume !(0 == ~tmp___4~0); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {13714#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {13714#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {13714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {13714#true} ~skip~0 := 0; {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {13714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {13714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {13714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {13714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {13714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {13714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {13714#true} assume 4368 == #t~mem54;havoc #t~mem54; {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {13714#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {13714#true} is VALID [2022-04-08 08:36:59,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {13714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13714#true} is VALID [2022-04-08 08:36:59,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {13714#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13720#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {13720#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {13715#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {13715#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {13715#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {13715#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {13715#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {13715#false} assume !(0 == ~tmp___4~0); {13715#false} is VALID [2022-04-08 08:36:59,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {13715#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {13715#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {13715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {13715#false} ~skip~0 := 0; {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {13715#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {13715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {13715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {13715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {13715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {13715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {13715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {13715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {13715#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {13715#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {13715#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 69: Hoare triple {13715#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {13715#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {13715#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {13715#false} assume 4432 == #t~mem62;havoc #t~mem62; {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {13715#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {13715#false} assume 5 == ~blastFlag~0; {13715#false} is VALID [2022-04-08 08:36:59,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-08 08:36:59,691 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:36:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:59,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247484443] [2022-04-08 08:36:59,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247484443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:59,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:59,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:59,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311669639] [2022-04-08 08:36:59,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311669639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:59,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:59,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028366857] [2022-04-08 08:36:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:59,693 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:36:59,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:59,693 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:36:59,745 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:36:59,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:59,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:59,746 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:37:01,766 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:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:02,605 INFO L93 Difference]: Finished difference Result 407 states and 599 transitions. [2022-04-08 08:37:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:02,605 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:37:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:02,605 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:37:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-08 08:37:02,619 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:37:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-08 08:37:02,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-08 08:37:02,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:02,851 INFO L225 Difference]: With dead ends: 407 [2022-04-08 08:37:02,851 INFO L226 Difference]: Without dead ends: 272 [2022-04-08 08:37:02,851 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:02,852 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:02,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 466 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:37:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-08 08:37:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-04-08 08:37:02,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:02,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:02,859 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:02,860 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:02,864 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-08 08:37:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-08 08:37:02,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:02,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:02,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 272 states. [2022-04-08 08:37:02,865 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 272 states. [2022-04-08 08:37:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:02,869 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-08 08:37:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-08 08:37:02,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:02,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:02,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:02,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:02,870 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:37:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-08 08:37:02,873 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-08 08:37:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:02,874 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-08 08:37:02,874 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:37:02,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-08 08:37:03,177 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:37:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-08 08:37:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:37:03,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:03,178 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:37:03,178 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:37:03,179 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 1 times [2022-04-08 08:37:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:03,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1818537475] [2022-04-08 08:37:03,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 2 times [2022-04-08 08:37:03,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:03,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432636540] [2022-04-08 08:37:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:03,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:03,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15612#true} is VALID [2022-04-08 08:37:03,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-08 08:37:03,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-08 08:37:03,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {15612#true} call ULTIMATE.init(); {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:03,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15612#true} is VALID [2022-04-08 08:37:03,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {15612#true} call #t~ret158 := main(); {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {15612#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {15612#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {15612#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {15612#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {15612#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {15612#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {15612#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {15612#true} assume 12292 == #t~mem49;havoc #t~mem49; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {15612#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {15612#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {15612#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {15612#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {15612#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {15612#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {15612#true} assume !(0 == ~tmp___4~0); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {15612#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {15612#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {15612#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {15612#true} assume 4368 == #t~mem54;havoc #t~mem54; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {15612#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {15612#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {15612#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {15612#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {15612#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {15612#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {15612#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {15612#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {15612#true} assume 4384 == #t~mem56;havoc #t~mem56; {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {15612#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15612#true} is VALID [2022-04-08 08:37:03,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {15612#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:03,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15613#false} is VALID [2022-04-08 08:37:03,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {15613#false} assume !false; {15613#false} is VALID [2022-04-08 08:37:03,317 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:37:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432636540] [2022-04-08 08:37:03,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432636540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:03,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:03,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:03,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1818537475] [2022-04-08 08:37:03,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1818537475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:03,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:03,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:03,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451367564] [2022-04-08 08:37:03,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:03,318 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:37:03,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:03,319 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:37:03,367 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:37:03,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:37:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:37:03,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:37:03,367 INFO L87 Difference]: Start difference. First operand 264 states and 385 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:05,383 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:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:06,272 INFO L93 Difference]: Finished difference Result 531 states and 783 transitions. [2022-04-08 08:37:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:37:06,273 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:37:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:06,273 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:37:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 08:37:06,276 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:37:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 08:37:06,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-08 08:37:06,597 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:37:06,604 INFO L225 Difference]: With dead ends: 531 [2022-04-08 08:37:06,604 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 08:37:06,604 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:37:06,604 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:06,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:37:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 08:37:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-04-08 08:37:06,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:06,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:06,615 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:06,616 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:06,622 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-08 08:37:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-08 08:37:06,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:06,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:06,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-08 08:37:06,624 INFO L87 Difference]: Start difference. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-08 08:37:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:06,630 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-08 08:37:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-08 08:37:06,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:06,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:06,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:06,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2022-04-08 08:37:06,638 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 77 [2022-04-08 08:37:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:06,638 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2022-04-08 08:37:06,638 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:37:06,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 577 transitions. [2022-04-08 08:37:07,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-08 08:37:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:37:07,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:07,069 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:07,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:37:07,070 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 1 times [2022-04-08 08:37:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:07,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1618616532] [2022-04-08 08:37:07,071 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 2 times [2022-04-08 08:37:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430972114] [2022-04-08 08:37:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:07,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18267#true} is VALID [2022-04-08 08:37:07,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-08 08:37:07,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {18267#true} call ULTIMATE.init(); {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:07,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {18267#true} call #t~ret158 := main(); {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {18267#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {18267#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {18267#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {18267#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {18267#true} is VALID [2022-04-08 08:37:07,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {18267#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {18267#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {18267#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {18267#true} assume 12292 == #t~mem49;havoc #t~mem49; {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {18267#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {18267#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {18267#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {18267#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {18267#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {18267#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {18267#true} assume !(0 == ~tmp___4~0); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {18267#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {18267#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {18267#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {18267#true} ~skip~0 := 0; {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {18267#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {18267#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {18267#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {18267#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {18267#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {18267#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {18267#true} assume 4368 == #t~mem54;havoc #t~mem54; {18267#true} is VALID [2022-04-08 08:37:07,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {18267#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {18267#true} is VALID [2022-04-08 08:37:07,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {18267#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {18268#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {18268#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {18268#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {18268#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {18268#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {18268#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18268#false} is VALID [2022-04-08 08:37:07,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {18268#false} ~skip~0 := 0; {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {18268#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {18268#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {18268#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {18268#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {18268#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {18268#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {18268#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {18268#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {18268#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {18268#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {18268#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {18268#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {18268#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {18268#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-08 08:37:07,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {18268#false} assume 4432 == #t~mem62;havoc #t~mem62; {18268#false} is VALID [2022-04-08 08:37:07,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {18268#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {18268#false} is VALID [2022-04-08 08:37:07,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {18268#false} assume 5 == ~blastFlag~0; {18268#false} is VALID [2022-04-08 08:37:07,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-08 08:37:07,209 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:37:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430972114] [2022-04-08 08:37:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430972114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:07,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:07,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:07,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:07,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1618616532] [2022-04-08 08:37:07,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1618616532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:07,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:07,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764288230] [2022-04-08 08:37:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-08 08:37:07,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:07,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:07,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:07,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:37:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:07,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:37:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:37:07,265 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:09,281 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:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:09,826 INFO L93 Difference]: Finished difference Result 687 states and 1003 transitions. [2022-04-08 08:37:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:37:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-08 08:37:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-08 08:37:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-08 08:37:09,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-08 08:37:10,079 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:37:10,087 INFO L225 Difference]: With dead ends: 687 [2022-04-08 08:37:10,087 INFO L226 Difference]: Without dead ends: 420 [2022-04-08 08:37:10,087 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:37:10,088 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:37:10,088 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:37:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-08 08:37:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-08 08:37:10,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:10,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:10,099 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:10,099 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:10,105 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-08 08:37:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-08 08:37:10,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:10,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:10,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-08 08:37:10,107 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-08 08:37:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:10,113 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-08 08:37:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-08 08:37:10,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:10,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:10,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:10,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-08 08:37:10,121 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 78 [2022-04-08 08:37:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:10,122 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-08 08:37:10,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:10,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-08 08:37:10,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-08 08:37:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 08:37:10,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:10,573 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:37:10,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:37:10,574 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 1 times [2022-04-08 08:37:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417191399] [2022-04-08 08:37:10,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 2 times [2022-04-08 08:37:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:10,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258103166] [2022-04-08 08:37:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:10,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21330#true} is VALID [2022-04-08 08:37:10,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-08 08:37:10,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {21330#true} call ULTIMATE.init(); {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:10,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {21330#true} call #t~ret158 := main(); {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {21330#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {21330#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21330#true} is VALID [2022-04-08 08:37:10,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {21330#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {21330#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {21330#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {21330#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {21330#true} assume 12292 == #t~mem49;havoc #t~mem49; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {21330#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {21330#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {21330#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {21330#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {21330#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {21330#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {21330#true} assume !(0 == ~tmp___4~0); {21330#true} is VALID [2022-04-08 08:37:10,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {21330#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {21330#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {21330#true} assume 4368 == #t~mem54;havoc #t~mem54; {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {21330#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {21330#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21330#true} is VALID [2022-04-08 08:37:10,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {21330#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {21330#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21330#true} is VALID [2022-04-08 08:37:10,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {21330#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {21330#true} assume 4384 == #t~mem56;havoc #t~mem56; {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {21330#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {21330#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {21330#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {21330#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {21330#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {21330#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-08 08:37:10,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {21330#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {21330#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {21330#true} assume 4400 == #t~mem58;havoc #t~mem58; {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {21330#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {21330#true} is VALID [2022-04-08 08:37:10,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {21330#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21330#true} is VALID [2022-04-08 08:37:10,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {21330#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,727 INFO L290 TraceCheckUtils]: 76: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,728 INFO L290 TraceCheckUtils]: 80: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,728 INFO L290 TraceCheckUtils]: 81: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,729 INFO L290 TraceCheckUtils]: 82: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,729 INFO L290 TraceCheckUtils]: 83: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,729 INFO L290 TraceCheckUtils]: 84: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,729 INFO L290 TraceCheckUtils]: 85: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,730 INFO L290 TraceCheckUtils]: 86: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,730 INFO L290 TraceCheckUtils]: 87: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,730 INFO L290 TraceCheckUtils]: 89: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,731 INFO L290 TraceCheckUtils]: 90: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,731 INFO L290 TraceCheckUtils]: 91: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,731 INFO L290 TraceCheckUtils]: 92: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,731 INFO L290 TraceCheckUtils]: 93: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,732 INFO L290 TraceCheckUtils]: 94: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:37:10,732 INFO L290 TraceCheckUtils]: 95: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21331#false} is VALID [2022-04-08 08:37:10,732 INFO L290 TraceCheckUtils]: 96: Hoare triple {21331#false} assume !false; {21331#false} is VALID [2022-04-08 08:37:10,732 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:37:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258103166] [2022-04-08 08:37:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258103166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:10,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:10,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:10,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417191399] [2022-04-08 08:37:10,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417191399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:10,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:10,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910735542] [2022-04-08 08:37:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:10,734 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:37:10,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:10,734 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:37:10,787 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:10,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:37:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:37:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:37:10,788 INFO L87 Difference]: Start difference. First operand 420 states and 609 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:12,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:37:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:13,662 INFO L93 Difference]: Finished difference Result 842 states and 1230 transitions. [2022-04-08 08:37:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:37:13,662 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:37:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:13,662 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:37:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 08:37:13,664 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:37:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 08:37:13,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-08 08:37:14,005 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:37:14,016 INFO L225 Difference]: With dead ends: 842 [2022-04-08 08:37:14,016 INFO L226 Difference]: Without dead ends: 551 [2022-04-08 08:37:14,017 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:37:14,017 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:37:14,018 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:37:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-08 08:37:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-08 08:37:14,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:14,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:14,032 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:14,038 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:14,048 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-08 08:37:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-08 08:37:14,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:14,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:14,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-08 08:37:14,051 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-08 08:37:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:14,061 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-08 08:37:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-08 08:37:14,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:14,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:14,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:14,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-08 08:37:14,074 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-08 08:37:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:14,074 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-08 08:37:14,074 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:37:14,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-08 08:37:14,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-08 08:37:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 08:37:14,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:14,489 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:37:14,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:37:14,489 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-08 08:37:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:14,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969492336] [2022-04-08 08:37:14,490 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 2 times [2022-04-08 08:37:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:14,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27694842] [2022-04-08 08:37:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:14,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:14,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {25233#(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); {25227#true} is VALID [2022-04-08 08:37:14,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {25227#true} assume true; {25227#true} is VALID [2022-04-08 08:37:14,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25227#true} {25227#true} #593#return; {25227#true} is VALID [2022-04-08 08:37:14,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {25227#true} call ULTIMATE.init(); {25233#(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:14,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {25233#(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); {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {25227#true} assume true; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25227#true} {25227#true} #593#return; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {25227#true} call #t~ret158 := main(); {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {25227#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {25227#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); {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {25227#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {25227#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {25227#true} assume 12292 == #t~mem49;havoc #t~mem49; {25227#true} is VALID [2022-04-08 08:37:14,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {25227#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {25227#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {25227#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {25227#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); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {25227#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {25227#true} assume !(0 == ~tmp___4~0); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {25227#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); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {25227#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {25227#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {25227#true} assume 4368 == #t~mem54;havoc #t~mem54; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {25227#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {25227#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); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {25227#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {25227#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {25227#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {25227#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {25227#true} assume 4384 == #t~mem56;havoc #t~mem56; {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {25227#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {25227#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {25227#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {25227#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {25227#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {25227#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {25227#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {25227#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {25227#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {25227#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {25227#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {25227#true} assume 4400 == #t~mem58;havoc #t~mem58; {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {25227#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); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 71: Hoare triple {25227#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; {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 72: Hoare triple {25227#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 73: Hoare triple {25227#true} assume !(~ret~0 <= 0); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 74: Hoare triple {25227#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {25227#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {25227#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {25227#true} ~skip~0 := 0; {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {25227#true} assume !false; {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 79: Hoare triple {25227#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {25227#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 81: Hoare triple {25227#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 82: Hoare triple {25227#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {25227#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {25227#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {25227#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {25227#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {25227#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {25227#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {25227#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 90: Hoare triple {25227#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 91: Hoare triple {25227#true} assume 4416 == #t~mem60;havoc #t~mem60; {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 92: Hoare triple {25227#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {25227#true} is VALID [2022-04-08 08:37:14,658 INFO L290 TraceCheckUtils]: 93: Hoare triple {25227#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,659 INFO L290 TraceCheckUtils]: 94: Hoare triple {25232#(= 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); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {25232#(= 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); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,659 INFO L290 TraceCheckUtils]: 97: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,660 INFO L290 TraceCheckUtils]: 98: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,660 INFO L290 TraceCheckUtils]: 99: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {25232#(= 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); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,661 INFO L290 TraceCheckUtils]: 102: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,661 INFO L290 TraceCheckUtils]: 103: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,661 INFO L290 TraceCheckUtils]: 104: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,662 INFO L290 TraceCheckUtils]: 106: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,662 INFO L290 TraceCheckUtils]: 107: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,662 INFO L290 TraceCheckUtils]: 108: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,662 INFO L290 TraceCheckUtils]: 109: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,663 INFO L290 TraceCheckUtils]: 110: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,663 INFO L290 TraceCheckUtils]: 111: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,663 INFO L290 TraceCheckUtils]: 112: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,664 INFO L290 TraceCheckUtils]: 113: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,664 INFO L290 TraceCheckUtils]: 114: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,664 INFO L290 TraceCheckUtils]: 115: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {25232#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:37:14,664 INFO L290 TraceCheckUtils]: 116: Hoare triple {25232#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25228#false} is VALID [2022-04-08 08:37:14,664 INFO L290 TraceCheckUtils]: 117: Hoare triple {25228#false} assume !false; {25228#false} is VALID [2022-04-08 08:37:14,665 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:37:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27694842] [2022-04-08 08:37:14,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27694842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:14,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:14,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:14,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969492336] [2022-04-08 08:37:14,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969492336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:14,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:14,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861730998] [2022-04-08 08:37:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:14,666 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:37:14,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:14,666 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:37:14,725 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:37:14,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:37:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:37:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:37:14,725 INFO L87 Difference]: Start difference. First operand 551 states and 800 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:37:16,742 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:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:17,651 INFO L93 Difference]: Finished difference Result 1103 states and 1610 transitions. [2022-04-08 08:37:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:37:17,651 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:37:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:17,651 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:37:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 08:37:17,653 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:37:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 08:37:17,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-08 08:37:17,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:17,870 INFO L225 Difference]: With dead ends: 1103 [2022-04-08 08:37:17,870 INFO L226 Difference]: Without dead ends: 681 [2022-04-08 08:37:17,871 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:37:17,871 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:17,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 474 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:37:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-04-08 08:37:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2022-04-08 08:37:17,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:17,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 681 states. Second operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call 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:17,890 INFO L74 IsIncluded]: Start isIncluded. First operand 681 states. Second operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call 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:17,891 INFO L87 Difference]: Start difference. First operand 681 states. Second operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call 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:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:17,904 INFO L93 Difference]: Finished difference Result 681 states and 989 transitions. [2022-04-08 08:37:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 989 transitions. [2022-04-08 08:37:17,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:17,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:17,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 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 681 states. [2022-04-08 08:37:17,907 INFO L87 Difference]: Start difference. First operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 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 681 states. [2022-04-08 08:37:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:17,921 INFO L93 Difference]: Finished difference Result 681 states and 989 transitions. [2022-04-08 08:37:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 989 transitions. [2022-04-08 08:37:17,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:17,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:17,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:17,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 676 states have (on average 1.4571005917159763) internal successors, (985), 676 states have internal predecessors, (985), 3 states have call successors, (3), 3 states have call 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:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 989 transitions. [2022-04-08 08:37:17,942 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 989 transitions. Word has length 118 [2022-04-08 08:37:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:17,942 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 989 transitions. [2022-04-08 08:37:17,942 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:37:17,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 681 states and 989 transitions. [2022-04-08 08:37:18,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 989 edges. 989 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 989 transitions. [2022-04-08 08:37:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 08:37:18,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:18,709 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 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] [2022-04-08 08:37:18,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:37:18,709 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 707325485, now seen corresponding path program 1 times [2022-04-08 08:37:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:18,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114106246] [2022-04-08 08:37:39,719 WARN L232 SmtUtils]: Spent 17.45s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:37:48,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash 707325485, now seen corresponding path program 2 times [2022-04-08 08:37:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:48,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793040001] [2022-04-08 08:37:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:48,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {30173#(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); {30166#true} is VALID [2022-04-08 08:37:48,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {30166#true} assume true; {30166#true} is VALID [2022-04-08 08:37:48,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30166#true} {30166#true} #593#return; {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {30166#true} call ULTIMATE.init(); {30173#(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:48,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {30173#(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); {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {30166#true} assume true; {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30166#true} {30166#true} #593#return; {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {30166#true} call #t~ret158 := main(); {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {30166#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30166#true} is VALID [2022-04-08 08:37:48,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {30166#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); {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {30166#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {30166#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {30166#true} assume 12292 == #t~mem49;havoc #t~mem49; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {30166#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {30166#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {30166#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {30166#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); {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {30166#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {30166#true} is VALID [2022-04-08 08:37:48,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {30166#true} assume !(0 == ~tmp___4~0); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {30166#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); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {30166#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {30166#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {30166#true} assume 4368 == #t~mem54;havoc #t~mem54; {30166#true} is VALID [2022-04-08 08:37:48,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {30166#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {30166#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); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {30166#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {30166#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {30166#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {30166#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {30166#true} assume 4384 == #t~mem56;havoc #t~mem56; {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {30166#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {30166#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {30166#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {30166#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {30166#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {30166#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {30166#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 61: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 62: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 63: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {30166#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {30166#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {30166#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {30166#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {30166#true} assume 4400 == #t~mem58;havoc #t~mem58; {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 70: Hoare triple {30166#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); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {30166#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; {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {30166#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {30166#true} assume !(~ret~0 <= 0); {30166#true} is VALID [2022-04-08 08:37:48,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {30166#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {30166#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {30166#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {30166#true} ~skip~0 := 0; {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {30166#true} assume !false; {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {30166#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {30166#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {30166#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 82: Hoare triple {30166#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {30166#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {30166#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {30166#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {30166#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {30166#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {30166#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {30166#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {30166#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30166#true} is VALID [2022-04-08 08:37:48,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {30166#true} assume 4416 == #t~mem60;havoc #t~mem60; {30166#true} is VALID [2022-04-08 08:37:48,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {30166#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {30166#true} is VALID [2022-04-08 08:37:48,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {30166#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30166#true} is VALID [2022-04-08 08:37:48,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {30166#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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,790 INFO L290 TraceCheckUtils]: 95: Hoare triple {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,791 INFO L290 TraceCheckUtils]: 97: Hoare triple {30171#(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; {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,792 INFO L290 TraceCheckUtils]: 98: Hoare triple {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,792 INFO L290 TraceCheckUtils]: 99: Hoare triple {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,793 INFO L290 TraceCheckUtils]: 101: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,793 INFO L290 TraceCheckUtils]: 102: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,794 INFO L290 TraceCheckUtils]: 104: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,795 INFO L290 TraceCheckUtils]: 105: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,795 INFO L290 TraceCheckUtils]: 106: Hoare triple {30171#(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); {30171#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:37:48,795 INFO L290 TraceCheckUtils]: 107: Hoare triple {30171#(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); {30172#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 108: Hoare triple {30172#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 109: Hoare triple {30167#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 110: Hoare triple {30167#false} assume !(1 == ~blastFlag~0); {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 111: Hoare triple {30167#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 112: Hoare triple {30167#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 113: Hoare triple {30167#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 114: Hoare triple {30167#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 115: Hoare triple {30167#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); {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 116: Hoare triple {30167#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {30167#false} is VALID [2022-04-08 08:37:48,796 INFO L290 TraceCheckUtils]: 117: Hoare triple {30167#false} ~skip~0 := 0; {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 118: Hoare triple {30167#false} assume !false; {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 119: Hoare triple {30167#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); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 120: Hoare triple {30167#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 121: Hoare triple {30167#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 122: Hoare triple {30167#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 123: Hoare triple {30167#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 124: Hoare triple {30167#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 125: Hoare triple {30167#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 126: Hoare triple {30167#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 127: Hoare triple {30167#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 128: Hoare triple {30167#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 129: Hoare triple {30167#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 130: Hoare triple {30167#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,797 INFO L290 TraceCheckUtils]: 131: Hoare triple {30167#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,798 INFO L290 TraceCheckUtils]: 132: Hoare triple {30167#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30167#false} is VALID [2022-04-08 08:37:48,798 INFO L290 TraceCheckUtils]: 133: Hoare triple {30167#false} assume 4432 == #t~mem62;havoc #t~mem62; {30167#false} is VALID [2022-04-08 08:37:48,798 INFO L290 TraceCheckUtils]: 134: Hoare triple {30167#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {30167#false} is VALID [2022-04-08 08:37:48,798 INFO L290 TraceCheckUtils]: 135: Hoare triple {30167#false} assume 5 == ~blastFlag~0; {30167#false} is VALID [2022-04-08 08:37:48,798 INFO L290 TraceCheckUtils]: 136: Hoare triple {30167#false} assume !false; {30167#false} is VALID [2022-04-08 08:37:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 08:37:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:48,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793040001] [2022-04-08 08:37:48,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793040001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:48,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:48,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114106246] [2022-04-08 08:37:48,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114106246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:48,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273177186] [2022-04-08 08:37:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:48,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 137 [2022-04-08 08:37:48,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:48,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call 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:48,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:48,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:48,874 INFO L87 Difference]: Start difference. First operand 681 states and 989 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call 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:50,895 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:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:51,951 INFO L93 Difference]: Finished difference Result 1735 states and 2536 transitions. [2022-04-08 08:37:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:51,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 137 [2022-04-08 08:37:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call 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:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:37:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call 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:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:37:51,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:37:52,302 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:37:52,345 INFO L225 Difference]: With dead ends: 1735 [2022-04-08 08:37:52,346 INFO L226 Difference]: Without dead ends: 1070 [2022-04-08 08:37:52,347 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:52,348 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 110 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:52,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:37:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-04-08 08:37:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 711. [2022-04-08 08:37:52,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:52,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1070 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call 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,412 INFO L74 IsIncluded]: Start isIncluded. First operand 1070 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call 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,427 INFO L87 Difference]: Start difference. First operand 1070 states. Second operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call 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,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:52,481 INFO L93 Difference]: Finished difference Result 1070 states and 1562 transitions. [2022-04-08 08:37:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1562 transitions. [2022-04-08 08:37:52,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:52,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:52,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 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 1070 states. [2022-04-08 08:37:52,484 INFO L87 Difference]: Start difference. First operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 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 1070 states. [2022-04-08 08:37:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:52,533 INFO L93 Difference]: Finished difference Result 1070 states and 1562 transitions. [2022-04-08 08:37:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1562 transitions. [2022-04-08 08:37:52,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:52,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:52,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:52,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 706 states have (on average 1.4730878186968839) internal successors, (1040), 706 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call 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,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1044 transitions. [2022-04-08 08:37:52,577 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1044 transitions. Word has length 137 [2022-04-08 08:37:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:52,577 INFO L478 AbstractCegarLoop]: Abstraction has 711 states and 1044 transitions. [2022-04-08 08:37:52,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call 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,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 711 states and 1044 transitions. [2022-04-08 08:37:53,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1044 edges. 1044 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1044 transitions. [2022-04-08 08:37:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 08:37:53,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:53,397 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 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] [2022-04-08 08:37:53,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:37:53,397 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1627312080, now seen corresponding path program 1 times [2022-04-08 08:37:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:53,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353045317] [2022-04-08 08:38:04,345 WARN L232 SmtUtils]: Spent 6.88s 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:12,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1627312080, now seen corresponding path program 2 times [2022-04-08 08:38:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:12,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348242873] [2022-04-08 08:38:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:12,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {37217#(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); {37210#true} is VALID [2022-04-08 08:38:12,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {37210#true} assume true; {37210#true} is VALID [2022-04-08 08:38:12,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37210#true} {37210#true} #593#return; {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {37210#true} call ULTIMATE.init(); {37217#(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:12,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {37217#(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); {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {37210#true} assume true; {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37210#true} {37210#true} #593#return; {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {37210#true} call #t~ret158 := main(); {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {37210#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37210#true} is VALID [2022-04-08 08:38:12,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {37210#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); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {37210#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {37210#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {37210#true} assume 12292 == #t~mem49;havoc #t~mem49; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {37210#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {37210#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {37210#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {37210#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); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {37210#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {37210#true} assume !(0 == ~tmp___4~0); {37210#true} is VALID [2022-04-08 08:38:12,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {37210#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); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {37210#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {37210#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {37210#true} assume 4368 == #t~mem54;havoc #t~mem54; {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {37210#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {37210#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); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {37210#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {37210#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {37210#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {37210#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {37210#true} assume 4384 == #t~mem56;havoc #t~mem56; {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {37210#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {37210#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {37210#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {37210#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {37210#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {37210#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {37210#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {37210#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {37210#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {37210#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {37210#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {37210#true} assume 4400 == #t~mem58;havoc #t~mem58; {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 70: Hoare triple {37210#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); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 71: Hoare triple {37210#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; {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {37210#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {37210#true} assume !(~ret~0 <= 0); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {37210#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 75: Hoare triple {37210#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,406 INFO L290 TraceCheckUtils]: 76: Hoare triple {37210#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {37210#true} ~skip~0 := 0; {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {37210#true} assume !false; {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {37210#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 80: Hoare triple {37210#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 81: Hoare triple {37210#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 82: Hoare triple {37210#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 83: Hoare triple {37210#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 84: Hoare triple {37210#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {37210#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {37210#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {37210#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 88: Hoare triple {37210#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,407 INFO L290 TraceCheckUtils]: 89: Hoare triple {37210#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,408 INFO L290 TraceCheckUtils]: 90: Hoare triple {37210#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37210#true} is VALID [2022-04-08 08:38:12,408 INFO L290 TraceCheckUtils]: 91: Hoare triple {37210#true} assume 4416 == #t~mem60;havoc #t~mem60; {37210#true} is VALID [2022-04-08 08:38:12,408 INFO L290 TraceCheckUtils]: 92: Hoare triple {37210#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37210#true} is VALID [2022-04-08 08:38:12,408 INFO L290 TraceCheckUtils]: 93: Hoare triple {37210#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37210#true} is VALID [2022-04-08 08:38:12,409 INFO L290 TraceCheckUtils]: 94: Hoare triple {37210#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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,409 INFO L290 TraceCheckUtils]: 95: Hoare triple {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,409 INFO L290 TraceCheckUtils]: 96: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {37215#(= 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; {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,410 INFO L290 TraceCheckUtils]: 98: Hoare triple {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,410 INFO L290 TraceCheckUtils]: 99: Hoare triple {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,411 INFO L290 TraceCheckUtils]: 101: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,411 INFO L290 TraceCheckUtils]: 102: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,411 INFO L290 TraceCheckUtils]: 103: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,411 INFO L290 TraceCheckUtils]: 104: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,412 INFO L290 TraceCheckUtils]: 105: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,412 INFO L290 TraceCheckUtils]: 106: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,412 INFO L290 TraceCheckUtils]: 107: Hoare triple {37215#(= 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); {37215#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 108: Hoare triple {37215#(= 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); {37216#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 109: Hoare triple {37216#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 110: Hoare triple {37211#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {37211#false} assume !(1 == ~blastFlag~0); {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {37211#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {37211#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 114: Hoare triple {37211#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 115: Hoare triple {37211#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,413 INFO L290 TraceCheckUtils]: 116: Hoare triple {37211#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); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 117: Hoare triple {37211#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 118: Hoare triple {37211#false} ~skip~0 := 0; {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 119: Hoare triple {37211#false} assume !false; {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 120: Hoare triple {37211#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); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 121: Hoare triple {37211#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 122: Hoare triple {37211#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 123: Hoare triple {37211#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 124: Hoare triple {37211#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 125: Hoare triple {37211#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 126: Hoare triple {37211#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 127: Hoare triple {37211#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 128: Hoare triple {37211#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,414 INFO L290 TraceCheckUtils]: 129: Hoare triple {37211#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 130: Hoare triple {37211#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 131: Hoare triple {37211#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 132: Hoare triple {37211#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 133: Hoare triple {37211#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 134: Hoare triple {37211#false} assume 4432 == #t~mem62;havoc #t~mem62; {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 135: Hoare triple {37211#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 136: Hoare triple {37211#false} assume 5 == ~blastFlag~0; {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L290 TraceCheckUtils]: 137: Hoare triple {37211#false} assume !false; {37211#false} is VALID [2022-04-08 08:38:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 08:38:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348242873] [2022-04-08 08:38:12,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348242873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:12,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:12,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:12,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353045317] [2022-04-08 08:38:12,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353045317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:12,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:12,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136233766] [2022-04-08 08:38:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 138 [2022-04-08 08:38:12,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:12,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call 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:12,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:12,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:38:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:38:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:38:12,494 INFO L87 Difference]: Start difference. First operand 711 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call 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:14,521 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:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:15,870 INFO L93 Difference]: Finished difference Result 1749 states and 2574 transitions. [2022-04-08 08:38:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:38:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 138 [2022-04-08 08:38:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call 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:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:38:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call 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:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:38:15,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-08 08:38:16,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:16,202 INFO L225 Difference]: With dead ends: 1749 [2022-04-08 08:38:16,202 INFO L226 Difference]: Without dead ends: 1054 [2022-04-08 08:38:16,203 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:16,203 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 93 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:16,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 565 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:38:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-04-08 08:38:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 787. [2022-04-08 08:38:16,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:16,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1054 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call 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:16,230 INFO L74 IsIncluded]: Start isIncluded. First operand 1054 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call 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:16,230 INFO L87 Difference]: Start difference. First operand 1054 states. Second operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call 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:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:16,259 INFO L93 Difference]: Finished difference Result 1054 states and 1546 transitions. [2022-04-08 08:38:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1546 transitions. [2022-04-08 08:38:16,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:16,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:16,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 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 1054 states. [2022-04-08 08:38:16,262 INFO L87 Difference]: Start difference. First operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 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 1054 states. [2022-04-08 08:38:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:16,292 INFO L93 Difference]: Finished difference Result 1054 states and 1546 transitions. [2022-04-08 08:38:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1546 transitions. [2022-04-08 08:38:16,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:16,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:16,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:16,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 782 states have (on average 1.4782608695652173) internal successors, (1156), 782 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call 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:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1160 transitions. [2022-04-08 08:38:16,328 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1160 transitions. Word has length 138 [2022-04-08 08:38:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:16,328 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 1160 transitions. [2022-04-08 08:38:16,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call 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:16,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 787 states and 1160 transitions. [2022-04-08 08:38:17,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1160 edges. 1160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1160 transitions. [2022-04-08 08:38:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-08 08:38:17,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:17,259 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:17,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:38:17,259 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:17,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1029384155, now seen corresponding path program 1 times [2022-04-08 08:38:17,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:17,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066617673] [2022-04-08 08:38:39,210 WARN L232 SmtUtils]: Spent 16.57s 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:48,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1029384155, now seen corresponding path program 2 times [2022-04-08 08:38:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:48,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914627809] [2022-04-08 08:38:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:48,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:48,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {44409#(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); {44402#true} is VALID [2022-04-08 08:38:48,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {44402#true} assume true; {44402#true} is VALID [2022-04-08 08:38:48,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44402#true} {44402#true} #593#return; {44402#true} is VALID [2022-04-08 08:38:48,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {44402#true} call ULTIMATE.init(); {44409#(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:48,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {44409#(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); {44402#true} is VALID [2022-04-08 08:38:48,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {44402#true} assume true; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44402#true} {44402#true} #593#return; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {44402#true} call #t~ret158 := main(); {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {44402#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {44402#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); {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {44402#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {44402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {44402#true} assume 12292 == #t~mem49;havoc #t~mem49; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {44402#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {44402#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {44402#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {44402#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); {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {44402#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {44402#true} assume !(0 == ~tmp___4~0); {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {44402#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); {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {44402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-08 08:38:48,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-08 08:38:48,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {44402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {44402#true} assume 4368 == #t~mem54;havoc #t~mem54; {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {44402#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {44402#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); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {44402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-08 08:38:48,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {44402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {44402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {44402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {44402#true} assume 4384 == #t~mem56;havoc #t~mem56; {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {44402#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {44402#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {44402#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {44402#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {44402#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {44402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {44402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {44402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {44402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {44402#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {44402#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {44402#true} assume 4400 == #t~mem58;havoc #t~mem58; {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {44402#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); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 71: Hoare triple {44402#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; {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 72: Hoare triple {44402#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 73: Hoare triple {44402#true} assume !(~ret~0 <= 0); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {44402#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {44402#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {44402#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {44402#true} ~skip~0 := 0; {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 78: Hoare triple {44402#true} assume !false; {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 79: Hoare triple {44402#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {44402#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {44402#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,240 INFO L290 TraceCheckUtils]: 82: Hoare triple {44402#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,240 INFO L290 TraceCheckUtils]: 83: Hoare triple {44402#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {44402#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {44402#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {44402#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 87: Hoare triple {44402#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {44402#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {44402#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {44402#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {44402#true} assume 4416 == #t~mem60;havoc #t~mem60; {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 92: Hoare triple {44402#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {44402#true} is VALID [2022-04-08 08:38:48,241 INFO L290 TraceCheckUtils]: 93: Hoare triple {44402#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44402#true} is VALID [2022-04-08 08:38:48,242 INFO L290 TraceCheckUtils]: 94: Hoare triple {44402#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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,242 INFO L290 TraceCheckUtils]: 95: Hoare triple {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,243 INFO L290 TraceCheckUtils]: 96: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,243 INFO L290 TraceCheckUtils]: 97: Hoare triple {44407#(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; {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,243 INFO L290 TraceCheckUtils]: 98: Hoare triple {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,244 INFO L290 TraceCheckUtils]: 99: Hoare triple {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,244 INFO L290 TraceCheckUtils]: 100: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,244 INFO L290 TraceCheckUtils]: 101: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,245 INFO L290 TraceCheckUtils]: 102: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,245 INFO L290 TraceCheckUtils]: 103: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,245 INFO L290 TraceCheckUtils]: 104: Hoare triple {44407#(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); {44407#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 105: Hoare triple {44407#(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); {44408#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 106: Hoare triple {44408#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 107: Hoare triple {44403#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; {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 108: Hoare triple {44403#false} assume !(0 == ~blastFlag~0); {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 109: Hoare triple {44403#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); {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 110: Hoare triple {44403#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; {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 111: Hoare triple {44403#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); {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 112: Hoare triple {44403#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 113: Hoare triple {44403#false} ~skip~0 := 0; {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 114: Hoare triple {44403#false} assume !false; {44403#false} is VALID [2022-04-08 08:38:48,246 INFO L290 TraceCheckUtils]: 115: Hoare triple {44403#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); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 116: Hoare triple {44403#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 117: Hoare triple {44403#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 118: Hoare triple {44403#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 119: Hoare triple {44403#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 120: Hoare triple {44403#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 121: Hoare triple {44403#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,247 INFO L290 TraceCheckUtils]: 122: Hoare triple {44403#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 123: Hoare triple {44403#false} assume 4384 == #t~mem56;havoc #t~mem56; {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 124: Hoare triple {44403#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 125: Hoare triple {44403#false} assume !(1 == ~blastFlag~0); {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 126: Hoare triple {44403#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 127: Hoare triple {44403#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 128: Hoare triple {44403#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 129: Hoare triple {44403#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 130: Hoare triple {44403#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); {44403#false} is VALID [2022-04-08 08:38:48,248 INFO L290 TraceCheckUtils]: 131: Hoare triple {44403#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 132: Hoare triple {44403#false} ~skip~0 := 0; {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 133: Hoare triple {44403#false} assume !false; {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 134: Hoare triple {44403#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); {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 135: Hoare triple {44403#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 136: Hoare triple {44403#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 137: Hoare triple {44403#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,249 INFO L290 TraceCheckUtils]: 138: Hoare triple {44403#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 139: Hoare triple {44403#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 140: Hoare triple {44403#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 141: Hoare triple {44403#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 142: Hoare triple {44403#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 143: Hoare triple {44403#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 144: Hoare triple {44403#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 145: Hoare triple {44403#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 146: Hoare triple {44403#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 147: Hoare triple {44403#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 148: Hoare triple {44403#false} assume 4432 == #t~mem62;havoc #t~mem62; {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 149: Hoare triple {44403#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 150: Hoare triple {44403#false} assume 5 == ~blastFlag~0; {44403#false} is VALID [2022-04-08 08:38:48,250 INFO L290 TraceCheckUtils]: 151: Hoare triple {44403#false} assume !false; {44403#false} is VALID [2022-04-08 08:38:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-08 08:38:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:48,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914627809] [2022-04-08 08:38:48,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914627809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:48,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:48,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:48,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:48,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066617673] [2022-04-08 08:38:48,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066617673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:48,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:48,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846784272] [2022-04-08 08:38:48,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:48,253 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 152 [2022-04-08 08:38:48,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:48,254 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:38:48,325 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:38:48,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:38:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:48,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:38:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:38:48,326 INFO L87 Difference]: Start difference. First operand 787 states and 1160 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:38:50,346 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:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:51,635 INFO L93 Difference]: Finished difference Result 1871 states and 2755 transitions. [2022-04-08 08:38:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:38:51,635 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 152 [2022-04-08 08:38:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:51,635 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:38:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:38:51,637 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:38:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:38:51,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:38:51,854 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:38:51,909 INFO L225 Difference]: With dead ends: 1871 [2022-04-08 08:38:51,909 INFO L226 Difference]: Without dead ends: 1236 [2022-04-08 08:38:51,910 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:51,910 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 114 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:51,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 512 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:38:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-04-08 08:38:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 867. [2022-04-08 08:38:51,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:51,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call 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:51,952 INFO L74 IsIncluded]: Start isIncluded. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call 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:51,953 INFO L87 Difference]: Start difference. First operand 1236 states. Second operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call 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:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:51,992 INFO L93 Difference]: Finished difference Result 1236 states and 1804 transitions. [2022-04-08 08:38:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1804 transitions. [2022-04-08 08:38:51,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:51,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:51,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 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 1236 states. [2022-04-08 08:38:51,995 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 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 1236 states. [2022-04-08 08:38:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:52,033 INFO L93 Difference]: Finished difference Result 1236 states and 1804 transitions. [2022-04-08 08:38:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1804 transitions. [2022-04-08 08:38:52,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:52,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:52,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:52,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 3 states have call successors, (3), 3 states have call 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:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1271 transitions. [2022-04-08 08:38:52,063 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1271 transitions. Word has length 152 [2022-04-08 08:38:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:52,063 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1271 transitions. [2022-04-08 08:38:52,063 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:38:52,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1271 transitions. [2022-04-08 08:38:53,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1271 edges. 1271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1271 transitions. [2022-04-08 08:38:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 08:38:53,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:53,007 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 3, 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] [2022-04-08 08:38:53,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:38:53,007 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1636398631, now seen corresponding path program 1 times [2022-04-08 08:38:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:53,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913128152] [2022-04-08 08:39:04,713 WARN L232 SmtUtils]: Spent 10.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:39:17,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1636398631, now seen corresponding path program 2 times [2022-04-08 08:39:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:17,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622557383] [2022-04-08 08:39:17,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:17,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {52369#(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); {52362#true} is VALID [2022-04-08 08:39:17,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {52362#true} assume true; {52362#true} is VALID [2022-04-08 08:39:17,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52362#true} {52362#true} #593#return; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {52362#true} call ULTIMATE.init(); {52369#(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:17,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {52369#(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); {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {52362#true} assume true; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52362#true} {52362#true} #593#return; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {52362#true} call #t~ret158 := main(); {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {52362#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {52362#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); {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {52362#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-08 08:39:17,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {52362#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {52362#true} assume 12292 == #t~mem49;havoc #t~mem49; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {52362#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {52362#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {52362#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {52362#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); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {52362#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {52362#true} assume !(0 == ~tmp___4~0); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {52362#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); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {52362#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {52362#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {52362#true} assume 4368 == #t~mem54;havoc #t~mem54; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {52362#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {52362#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); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {52362#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-08 08:39:17,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {52362#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {52362#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {52362#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {52362#true} assume 4384 == #t~mem56;havoc #t~mem56; {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {52362#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {52362#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {52362#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {52362#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {52362#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {52362#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-08 08:39:17,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-08 08:39:17,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-08 08:39:17,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {52362#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {52362#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {52362#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {52362#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {52362#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {52362#true} assume 4400 == #t~mem58;havoc #t~mem58; {52362#true} is VALID [2022-04-08 08:39:17,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {52362#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); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {52362#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; {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {52362#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {52362#true} assume !(~ret~0 <= 0); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {52362#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {52362#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {52362#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {52362#true} ~skip~0 := 0; {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {52362#true} assume !false; {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 79: Hoare triple {52362#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 80: Hoare triple {52362#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 81: Hoare triple {52362#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 82: Hoare triple {52362#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 83: Hoare triple {52362#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,316 INFO L290 TraceCheckUtils]: 84: Hoare triple {52362#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 85: Hoare triple {52362#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 86: Hoare triple {52362#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 87: Hoare triple {52362#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 88: Hoare triple {52362#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {52362#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {52362#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {52362#true} assume 4416 == #t~mem60;havoc #t~mem60; {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 92: Hoare triple {52362#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {52362#true} is VALID [2022-04-08 08:39:17,317 INFO L290 TraceCheckUtils]: 93: Hoare triple {52362#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52362#true} is VALID [2022-04-08 08:39:17,318 INFO L290 TraceCheckUtils]: 94: Hoare triple {52362#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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,318 INFO L290 TraceCheckUtils]: 95: Hoare triple {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {52367#(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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,319 INFO L290 TraceCheckUtils]: 97: Hoare triple {52367#(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; {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,320 INFO L290 TraceCheckUtils]: 98: Hoare triple {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,320 INFO L290 TraceCheckUtils]: 99: Hoare triple {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,320 INFO L290 TraceCheckUtils]: 100: Hoare triple {52367#(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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 101: Hoare triple {52367#(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); {52367#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {52367#(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); {52368#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 103: Hoare triple {52368#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {52363#false} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {52363#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 105: Hoare triple {52363#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52363#false} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 106: Hoare triple {52363#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,321 INFO L290 TraceCheckUtils]: 107: Hoare triple {52363#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); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 108: Hoare triple {52363#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 109: Hoare triple {52363#false} assume !(0 == ~tmp___4~0); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 110: Hoare triple {52363#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); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 111: Hoare triple {52363#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); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 112: Hoare triple {52363#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 113: Hoare triple {52363#false} ~skip~0 := 0; {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 114: Hoare triple {52363#false} assume !false; {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 115: Hoare triple {52363#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); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 116: Hoare triple {52363#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {52363#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 118: Hoare triple {52363#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 119: Hoare triple {52363#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 120: Hoare triple {52363#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,322 INFO L290 TraceCheckUtils]: 121: Hoare triple {52363#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 122: Hoare triple {52363#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 123: Hoare triple {52363#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 124: Hoare triple {52363#false} assume 4385 == #t~mem57;havoc #t~mem57; {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 125: Hoare triple {52363#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 126: Hoare triple {52363#false} assume !(1 == ~blastFlag~0); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 127: Hoare triple {52363#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 128: Hoare triple {52363#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 129: Hoare triple {52363#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 130: Hoare triple {52363#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 131: Hoare triple {52363#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); {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 132: Hoare triple {52363#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 133: Hoare triple {52363#false} ~skip~0 := 0; {52363#false} is VALID [2022-04-08 08:39:17,323 INFO L290 TraceCheckUtils]: 134: Hoare triple {52363#false} assume !false; {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 135: Hoare triple {52363#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); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 136: Hoare triple {52363#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 137: Hoare triple {52363#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 138: Hoare triple {52363#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 139: Hoare triple {52363#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 140: Hoare triple {52363#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 141: Hoare triple {52363#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 142: Hoare triple {52363#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 143: Hoare triple {52363#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 144: Hoare triple {52363#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 145: Hoare triple {52363#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 146: Hoare triple {52363#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 147: Hoare triple {52363#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 148: Hoare triple {52363#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52363#false} is VALID [2022-04-08 08:39:17,324 INFO L290 TraceCheckUtils]: 149: Hoare triple {52363#false} assume 4432 == #t~mem62;havoc #t~mem62; {52363#false} is VALID [2022-04-08 08:39:17,325 INFO L290 TraceCheckUtils]: 150: Hoare triple {52363#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {52363#false} is VALID [2022-04-08 08:39:17,325 INFO L290 TraceCheckUtils]: 151: Hoare triple {52363#false} assume 5 == ~blastFlag~0; {52363#false} is VALID [2022-04-08 08:39:17,325 INFO L290 TraceCheckUtils]: 152: Hoare triple {52363#false} assume !false; {52363#false} is VALID [2022-04-08 08:39:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 08:39:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:17,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622557383] [2022-04-08 08:39:17,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622557383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:17,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:17,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:17,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:17,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913128152] [2022-04-08 08:39:17,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913128152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:17,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:17,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352775834] [2022-04-08 08:39:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:17,328 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 153 [2022-04-08 08:39:17,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:17,329 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:17,417 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:17,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:17,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:17,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:17,418 INFO L87 Difference]: Start difference. First operand 867 states and 1271 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:19,448 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:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:20,667 INFO L93 Difference]: Finished difference Result 2077 states and 3040 transitions. [2022-04-08 08:39:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:20,667 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 153 [2022-04-08 08:39:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:20,667 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:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:39:20,669 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:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:39:20,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:39:20,986 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:39:21,063 INFO L225 Difference]: With dead ends: 2077 [2022-04-08 08:39:21,063 INFO L226 Difference]: Without dead ends: 1226 [2022-04-08 08:39:21,065 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:21,065 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 117 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:21,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 300 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:39:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-08 08:39:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 867. [2022-04-08 08:39:21,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:21,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call 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:21,102 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call 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:21,103 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call 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:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:21,140 INFO L93 Difference]: Finished difference Result 1226 states and 1775 transitions. [2022-04-08 08:39:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1775 transitions. [2022-04-08 08:39:21,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:21,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:21,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 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 1226 states. [2022-04-08 08:39:21,143 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 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 1226 states. [2022-04-08 08:39:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:21,180 INFO L93 Difference]: Finished difference Result 1226 states and 1775 transitions. [2022-04-08 08:39:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1775 transitions. [2022-04-08 08:39:21,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:21,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:21,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:21,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4535962877030162) internal successors, (1253), 862 states have internal predecessors, (1253), 3 states have call successors, (3), 3 states have call 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:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1257 transitions. [2022-04-08 08:39:21,210 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1257 transitions. Word has length 153 [2022-04-08 08:39:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:21,210 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1257 transitions. [2022-04-08 08:39:21,211 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:21,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1257 transitions. [2022-04-08 08:39:22,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1257 edges. 1257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1257 transitions. [2022-04-08 08:39:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 08:39:22,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:22,268 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 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] [2022-04-08 08:39:22,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:39:22,269 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -374709224, now seen corresponding path program 1 times [2022-04-08 08:39:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:22,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806319234] [2022-04-08 08:39:35,263 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:39:42,336 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -374709224, now seen corresponding path program 2 times [2022-04-08 08:39:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:42,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512686904] [2022-04-08 08:39:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:42,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:42,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {60721#(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); {60714#true} is VALID [2022-04-08 08:39:42,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {60714#true} assume true; {60714#true} is VALID [2022-04-08 08:39:42,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60714#true} {60714#true} #593#return; {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {60714#true} call ULTIMATE.init(); {60721#(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:42,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {60721#(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); {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {60714#true} assume true; {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60714#true} {60714#true} #593#return; {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {60714#true} call #t~ret158 := main(); {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {60714#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {60714#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); {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {60714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60714#true} is VALID [2022-04-08 08:39:42,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-08 08:39:42,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {60714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {60714#true} assume 12292 == #t~mem49;havoc #t~mem49; {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {60714#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {60714#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {60714#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {60714#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); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {60714#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {60714#true} assume !(0 == ~tmp___4~0); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {60714#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); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {60714#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-08 08:39:42,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {60714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {60714#true} assume 4368 == #t~mem54;havoc #t~mem54; {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {60714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {60714#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); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {60714#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-08 08:39:42,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {60714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {60714#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {60714#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {60714#true} assume 4384 == #t~mem56;havoc #t~mem56; {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {60714#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {60714#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {60714#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {60714#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {60714#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {60714#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {60714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {60714#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 66: Hoare triple {60714#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {60714#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {60714#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {60714#true} assume 4400 == #t~mem58;havoc #t~mem58; {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {60714#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); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {60714#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; {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {60714#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {60714#true} assume !(~ret~0 <= 0); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 74: Hoare triple {60714#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 75: Hoare triple {60714#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 76: Hoare triple {60714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 77: Hoare triple {60714#true} ~skip~0 := 0; {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 78: Hoare triple {60714#true} assume !false; {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {60714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 80: Hoare triple {60714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 81: Hoare triple {60714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,550 INFO L290 TraceCheckUtils]: 82: Hoare triple {60714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 83: Hoare triple {60714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {60714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 85: Hoare triple {60714#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {60714#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 87: Hoare triple {60714#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 88: Hoare triple {60714#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {60714#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 90: Hoare triple {60714#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 91: Hoare triple {60714#true} assume 4416 == #t~mem60;havoc #t~mem60; {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 92: Hoare triple {60714#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {60714#true} is VALID [2022-04-08 08:39:42,551 INFO L290 TraceCheckUtils]: 93: Hoare triple {60714#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {60714#true} is VALID [2022-04-08 08:39:42,553 INFO L290 TraceCheckUtils]: 94: Hoare triple {60714#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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,553 INFO L290 TraceCheckUtils]: 95: Hoare triple {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,553 INFO L290 TraceCheckUtils]: 96: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,554 INFO L290 TraceCheckUtils]: 97: Hoare triple {60719#(= 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; {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,554 INFO L290 TraceCheckUtils]: 98: Hoare triple {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,554 INFO L290 TraceCheckUtils]: 99: Hoare triple {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,554 INFO L290 TraceCheckUtils]: 100: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,555 INFO L290 TraceCheckUtils]: 101: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,555 INFO L290 TraceCheckUtils]: 102: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,555 INFO L290 TraceCheckUtils]: 103: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,555 INFO L290 TraceCheckUtils]: 104: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {60719#(= 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); {60719#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:39:42,556 INFO L290 TraceCheckUtils]: 106: Hoare triple {60719#(= 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); {60720#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-08 08:39:42,556 INFO L290 TraceCheckUtils]: 107: Hoare triple {60720#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {60715#false} is VALID [2022-04-08 08:39:42,556 INFO L290 TraceCheckUtils]: 108: Hoare triple {60715#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; {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 109: Hoare triple {60715#false} assume !(0 == ~blastFlag~0); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 110: Hoare triple {60715#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); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 111: Hoare triple {60715#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; {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 112: Hoare triple {60715#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); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 113: Hoare triple {60715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 114: Hoare triple {60715#false} ~skip~0 := 0; {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 115: Hoare triple {60715#false} assume !false; {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 116: Hoare triple {60715#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); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 117: Hoare triple {60715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 118: Hoare triple {60715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 119: Hoare triple {60715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 120: Hoare triple {60715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,557 INFO L290 TraceCheckUtils]: 121: Hoare triple {60715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 122: Hoare triple {60715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 123: Hoare triple {60715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 124: Hoare triple {60715#false} assume 4384 == #t~mem56;havoc #t~mem56; {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 125: Hoare triple {60715#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 126: Hoare triple {60715#false} assume !(1 == ~blastFlag~0); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 127: Hoare triple {60715#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 128: Hoare triple {60715#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 129: Hoare triple {60715#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 130: Hoare triple {60715#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 131: Hoare triple {60715#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); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 132: Hoare triple {60715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 133: Hoare triple {60715#false} ~skip~0 := 0; {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 134: Hoare triple {60715#false} assume !false; {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 135: Hoare triple {60715#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); {60715#false} is VALID [2022-04-08 08:39:42,558 INFO L290 TraceCheckUtils]: 136: Hoare triple {60715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 137: Hoare triple {60715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 138: Hoare triple {60715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 139: Hoare triple {60715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 140: Hoare triple {60715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 141: Hoare triple {60715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 142: Hoare triple {60715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 143: Hoare triple {60715#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 144: Hoare triple {60715#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 145: Hoare triple {60715#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 146: Hoare triple {60715#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 147: Hoare triple {60715#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 148: Hoare triple {60715#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60715#false} is VALID [2022-04-08 08:39:42,559 INFO L290 TraceCheckUtils]: 149: Hoare triple {60715#false} assume 4432 == #t~mem62;havoc #t~mem62; {60715#false} is VALID [2022-04-08 08:39:42,560 INFO L290 TraceCheckUtils]: 150: Hoare triple {60715#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {60715#false} is VALID [2022-04-08 08:39:42,560 INFO L290 TraceCheckUtils]: 151: Hoare triple {60715#false} assume 5 == ~blastFlag~0; {60715#false} is VALID [2022-04-08 08:39:42,560 INFO L290 TraceCheckUtils]: 152: Hoare triple {60715#false} assume !false; {60715#false} is VALID [2022-04-08 08:39:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-08 08:39:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512686904] [2022-04-08 08:39:42,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512686904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:42,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:42,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:42,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:42,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806319234] [2022-04-08 08:39:42,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806319234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:42,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:42,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170616900] [2022-04-08 08:39:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:42,561 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 153 [2022-04-08 08:39:42,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:42,562 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:39:42,633 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:39:42,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:42,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:42,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:42,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:42,634 INFO L87 Difference]: Start difference. First operand 867 states and 1257 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:39:44,656 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:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:46,080 INFO L93 Difference]: Finished difference Result 1821 states and 2644 transitions. [2022-04-08 08:39:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:46,094 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 153 [2022-04-08 08:39:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:46,095 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:39:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 08:39:46,096 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:39:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 08:39:46,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-08 08:39:46,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:46,494 INFO L225 Difference]: With dead ends: 1821 [2022-04-08 08:39:46,495 INFO L226 Difference]: Without dead ends: 1122 [2022-04-08 08:39:46,496 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:46,496 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 90 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:46,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 555 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:39:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-04-08 08:39:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 867. [2022-04-08 08:39:46,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:46,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call 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:46,532 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call 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:46,533 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call 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:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:46,565 INFO L93 Difference]: Finished difference Result 1122 states and 1626 transitions. [2022-04-08 08:39:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-04-08 08:39:46,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:46,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:46,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 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 1122 states. [2022-04-08 08:39:46,568 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 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 1122 states. [2022-04-08 08:39:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:46,600 INFO L93 Difference]: Finished difference Result 1122 states and 1626 transitions. [2022-04-08 08:39:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-04-08 08:39:46,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:46,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:46,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:46,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.448955916473318) internal successors, (1249), 862 states have internal predecessors, (1249), 3 states have call successors, (3), 3 states have call 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:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1253 transitions. [2022-04-08 08:39:46,649 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1253 transitions. Word has length 153 [2022-04-08 08:39:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:46,649 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1253 transitions. [2022-04-08 08:39:46,649 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:39:46,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1253 transitions. [2022-04-08 08:39:47,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1253 edges. 1253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1253 transitions. [2022-04-08 08:39:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-08 08:39:47,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:47,781 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 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] [2022-04-08 08:39:47,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:39:47,781 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -719726875, now seen corresponding path program 1 times [2022-04-08 08:39:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:47,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798542147] [2022-04-08 08:40:02,837 WARN L232 SmtUtils]: Spent 9.44s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:40:12,073 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -719726875, now seen corresponding path program 2 times [2022-04-08 08:40:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:12,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040622929] [2022-04-08 08:40:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:12,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {68353#(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); {68346#true} is VALID [2022-04-08 08:40:12,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {68346#true} assume true; {68346#true} is VALID [2022-04-08 08:40:12,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68346#true} {68346#true} #593#return; {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {68346#true} call ULTIMATE.init(); {68353#(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:12,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {68353#(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); {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {68346#true} assume true; {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68346#true} {68346#true} #593#return; {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {68346#true} call #t~ret158 := main(); {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {68346#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {68346#true} is VALID [2022-04-08 08:40:12,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {68346#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); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {68346#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {68346#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {68346#true} assume 12292 == #t~mem49;havoc #t~mem49; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {68346#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {68346#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {68346#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {68346#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); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {68346#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {68346#true} assume !(0 == ~tmp___4~0); {68346#true} is VALID [2022-04-08 08:40:12,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {68346#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); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {68346#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {68346#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {68346#true} assume 4368 == #t~mem54;havoc #t~mem54; {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {68346#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {68346#true} is VALID [2022-04-08 08:40:12,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {68346#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); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {68346#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {68346#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 43: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {68346#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {68346#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {68346#true} assume 4384 == #t~mem56;havoc #t~mem56; {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {68346#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {68346#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {68346#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {68346#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {68346#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {68346#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 58: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 59: Hoare triple {68346#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 61: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 62: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,262 INFO L290 TraceCheckUtils]: 63: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {68346#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 66: Hoare triple {68346#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {68346#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {68346#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {68346#true} assume 4400 == #t~mem58;havoc #t~mem58; {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {68346#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); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {68346#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; {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {68346#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 73: Hoare triple {68346#true} assume !(~ret~0 <= 0); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 74: Hoare triple {68346#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 75: Hoare triple {68346#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 76: Hoare triple {68346#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68346#true} is VALID [2022-04-08 08:40:12,263 INFO L290 TraceCheckUtils]: 77: Hoare triple {68346#true} ~skip~0 := 0; {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 78: Hoare triple {68346#true} assume !false; {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 79: Hoare triple {68346#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {68346#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 81: Hoare triple {68346#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 82: Hoare triple {68346#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 83: Hoare triple {68346#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {68346#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {68346#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {68346#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {68346#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {68346#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {68346#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {68346#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68346#true} is VALID [2022-04-08 08:40:12,264 INFO L290 TraceCheckUtils]: 91: Hoare triple {68346#true} assume 4416 == #t~mem60;havoc #t~mem60; {68346#true} is VALID [2022-04-08 08:40:12,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {68346#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {68346#true} is VALID [2022-04-08 08:40:12,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {68346#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {68346#true} is VALID [2022-04-08 08:40:12,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {68346#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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {68351#(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; {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,267 INFO L290 TraceCheckUtils]: 98: Hoare triple {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,267 INFO L290 TraceCheckUtils]: 99: Hoare triple {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,267 INFO L290 TraceCheckUtils]: 100: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {68351#(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); {68351#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:12,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {68351#(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); {68352#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 104: Hoare triple {68352#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 105: Hoare triple {68347#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 106: Hoare triple {68347#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 107: Hoare triple {68347#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 108: Hoare triple {68347#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); {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 109: Hoare triple {68347#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 110: Hoare triple {68347#false} assume !(0 == ~tmp___4~0); {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 111: Hoare triple {68347#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); {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 112: Hoare triple {68347#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); {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 113: Hoare triple {68347#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68347#false} is VALID [2022-04-08 08:40:12,269 INFO L290 TraceCheckUtils]: 114: Hoare triple {68347#false} ~skip~0 := 0; {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 115: Hoare triple {68347#false} assume !false; {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 116: Hoare triple {68347#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); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 117: Hoare triple {68347#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 118: Hoare triple {68347#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 119: Hoare triple {68347#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 120: Hoare triple {68347#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 121: Hoare triple {68347#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 122: Hoare triple {68347#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 123: Hoare triple {68347#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 124: Hoare triple {68347#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 125: Hoare triple {68347#false} assume 4385 == #t~mem57;havoc #t~mem57; {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 126: Hoare triple {68347#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 127: Hoare triple {68347#false} assume !(1 == ~blastFlag~0); {68347#false} is VALID [2022-04-08 08:40:12,270 INFO L290 TraceCheckUtils]: 128: Hoare triple {68347#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 129: Hoare triple {68347#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 130: Hoare triple {68347#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 131: Hoare triple {68347#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 132: Hoare triple {68347#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); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 133: Hoare triple {68347#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 134: Hoare triple {68347#false} ~skip~0 := 0; {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 135: Hoare triple {68347#false} assume !false; {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 136: Hoare triple {68347#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); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 137: Hoare triple {68347#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 138: Hoare triple {68347#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 139: Hoare triple {68347#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 140: Hoare triple {68347#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 141: Hoare triple {68347#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,271 INFO L290 TraceCheckUtils]: 142: Hoare triple {68347#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 143: Hoare triple {68347#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 144: Hoare triple {68347#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 145: Hoare triple {68347#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 146: Hoare triple {68347#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 147: Hoare triple {68347#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 148: Hoare triple {68347#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 149: Hoare triple {68347#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 150: Hoare triple {68347#false} assume 4432 == #t~mem62;havoc #t~mem62; {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 151: Hoare triple {68347#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 152: Hoare triple {68347#false} assume 5 == ~blastFlag~0; {68347#false} is VALID [2022-04-08 08:40:12,272 INFO L290 TraceCheckUtils]: 153: Hoare triple {68347#false} assume !false; {68347#false} is VALID [2022-04-08 08:40:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 08:40:12,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:12,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040622929] [2022-04-08 08:40:12,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040622929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:12,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:12,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:12,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:12,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798542147] [2022-04-08 08:40:12,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798542147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:12,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:12,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562434612] [2022-04-08 08:40:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:12,274 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 154 [2022-04-08 08:40:12,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:12,274 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:12,345 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:12,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:12,347 INFO L87 Difference]: Start difference. First operand 867 states and 1253 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:14,366 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:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:15,604 INFO L93 Difference]: Finished difference Result 2077 states and 3004 transitions. [2022-04-08 08:40:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:15,604 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 154 [2022-04-08 08:40:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:15,605 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:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 08:40:15,607 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:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 08:40:15,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-08 08:40:15,939 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:40:16,013 INFO L225 Difference]: With dead ends: 2077 [2022-04-08 08:40:16,013 INFO L226 Difference]: Without dead ends: 1226 [2022-04-08 08:40:16,014 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:16,015 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:16,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:40:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-08 08:40:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 867. [2022-04-08 08:40:16,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:16,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:16,056 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:16,057 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:16,093 INFO L93 Difference]: Finished difference Result 1226 states and 1757 transitions. [2022-04-08 08:40:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1757 transitions. [2022-04-08 08:40:16,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:16,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:16,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 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 1226 states. [2022-04-08 08:40:16,096 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 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 1226 states. [2022-04-08 08:40:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:16,133 INFO L93 Difference]: Finished difference Result 1226 states and 1757 transitions. [2022-04-08 08:40:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1757 transitions. [2022-04-08 08:40:16,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:16,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:16,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:16,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4327146171693736) internal successors, (1235), 862 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1239 transitions. [2022-04-08 08:40:16,165 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1239 transitions. Word has length 154 [2022-04-08 08:40:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:16,165 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1239 transitions. [2022-04-08 08:40:16,165 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:16,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1239 transitions. [2022-04-08 08:40:17,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1239 edges. 1239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1239 transitions. [2022-04-08 08:40:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 08:40:17,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:17,350 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 3, 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] [2022-04-08 08:40:17,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:40:17,351 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1947874174, now seen corresponding path program 1 times [2022-04-08 08:40:17,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:17,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047836153] [2022-04-08 08:40:31,530 WARN L232 SmtUtils]: Spent 8.18s 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:38,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1947874174, now seen corresponding path program 2 times [2022-04-08 08:40:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:38,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016919940] [2022-04-08 08:40:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:38,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {76705#(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); {76698#true} is VALID [2022-04-08 08:40:38,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {76698#true} assume true; {76698#true} is VALID [2022-04-08 08:40:38,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76698#true} {76698#true} #593#return; {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {76698#true} call ULTIMATE.init(); {76705#(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:38,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {76705#(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); {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {76698#true} assume true; {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76698#true} {76698#true} #593#return; {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {76698#true} call #t~ret158 := main(); {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {76698#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {76698#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); {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {76698#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {76698#true} is VALID [2022-04-08 08:40:38,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {76698#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {76698#true} assume 12292 == #t~mem49;havoc #t~mem49; {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {76698#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {76698#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {76698#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {76698#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); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {76698#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {76698#true} assume !(0 == ~tmp___4~0); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {76698#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); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {76698#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {76698#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {76698#true} assume 4368 == #t~mem54;havoc #t~mem54; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {76698#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {76698#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); {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {76698#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {76698#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {76698#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {76698#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {76698#true} assume 4384 == #t~mem56;havoc #t~mem56; {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {76698#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76698#true} is VALID [2022-04-08 08:40:38,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {76698#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {76698#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {76698#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {76698#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {76698#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {76698#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 65: Hoare triple {76698#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {76698#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {76698#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {76698#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {76698#true} assume 4400 == #t~mem58;havoc #t~mem58; {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {76698#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); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {76698#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; {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {76698#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {76698#true} assume !(~ret~0 <= 0); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {76698#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {76698#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {76698#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 77: Hoare triple {76698#true} ~skip~0 := 0; {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {76698#true} assume !false; {76698#true} is VALID [2022-04-08 08:40:38,906 INFO L290 TraceCheckUtils]: 79: Hoare triple {76698#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {76698#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {76698#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {76698#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {76698#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {76698#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {76698#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {76698#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 87: Hoare triple {76698#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {76698#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 89: Hoare triple {76698#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 90: Hoare triple {76698#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 91: Hoare triple {76698#true} assume 4416 == #t~mem60;havoc #t~mem60; {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 92: Hoare triple {76698#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {76698#true} is VALID [2022-04-08 08:40:38,907 INFO L290 TraceCheckUtils]: 93: Hoare triple {76698#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {76698#true} is VALID [2022-04-08 08:40:38,909 INFO L290 TraceCheckUtils]: 94: Hoare triple {76698#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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,909 INFO L290 TraceCheckUtils]: 95: Hoare triple {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,909 INFO L290 TraceCheckUtils]: 96: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,910 INFO L290 TraceCheckUtils]: 97: Hoare triple {76703#(= 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; {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,910 INFO L290 TraceCheckUtils]: 98: Hoare triple {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,910 INFO L290 TraceCheckUtils]: 99: Hoare triple {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,910 INFO L290 TraceCheckUtils]: 100: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,911 INFO L290 TraceCheckUtils]: 101: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,911 INFO L290 TraceCheckUtils]: 102: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,911 INFO L290 TraceCheckUtils]: 103: Hoare triple {76703#(= 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); {76703#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:38,911 INFO L290 TraceCheckUtils]: 104: Hoare triple {76703#(= 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); {76704#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 105: Hoare triple {76704#(= |ssl3_connect_#t~mem53| 4432)} assume 4099 == #t~mem53;havoc #t~mem53; {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 106: Hoare triple {76699#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 107: Hoare triple {76699#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 108: Hoare triple {76699#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 109: Hoare triple {76699#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); {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 110: Hoare triple {76699#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 111: Hoare triple {76699#false} assume !(0 == ~tmp___4~0); {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 112: Hoare triple {76699#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); {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 113: Hoare triple {76699#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); {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 114: Hoare triple {76699#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 115: Hoare triple {76699#false} ~skip~0 := 0; {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 116: Hoare triple {76699#false} assume !false; {76699#false} is VALID [2022-04-08 08:40:38,912 INFO L290 TraceCheckUtils]: 117: Hoare triple {76699#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); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 118: Hoare triple {76699#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 119: Hoare triple {76699#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 120: Hoare triple {76699#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 121: Hoare triple {76699#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 122: Hoare triple {76699#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 123: Hoare triple {76699#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 124: Hoare triple {76699#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 125: Hoare triple {76699#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 126: Hoare triple {76699#false} assume 4385 == #t~mem57;havoc #t~mem57; {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 127: Hoare triple {76699#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 128: Hoare triple {76699#false} assume !(1 == ~blastFlag~0); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 129: Hoare triple {76699#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 130: Hoare triple {76699#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,913 INFO L290 TraceCheckUtils]: 131: Hoare triple {76699#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 132: Hoare triple {76699#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 133: Hoare triple {76699#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); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 134: Hoare triple {76699#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 135: Hoare triple {76699#false} ~skip~0 := 0; {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 136: Hoare triple {76699#false} assume !false; {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 137: Hoare triple {76699#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); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 138: Hoare triple {76699#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 139: Hoare triple {76699#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 140: Hoare triple {76699#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 141: Hoare triple {76699#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 142: Hoare triple {76699#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 143: Hoare triple {76699#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 144: Hoare triple {76699#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,914 INFO L290 TraceCheckUtils]: 145: Hoare triple {76699#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 146: Hoare triple {76699#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 147: Hoare triple {76699#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 148: Hoare triple {76699#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 149: Hoare triple {76699#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 150: Hoare triple {76699#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 151: Hoare triple {76699#false} assume 4432 == #t~mem62;havoc #t~mem62; {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 152: Hoare triple {76699#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 153: Hoare triple {76699#false} assume 5 == ~blastFlag~0; {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L290 TraceCheckUtils]: 154: Hoare triple {76699#false} assume !false; {76699#false} is VALID [2022-04-08 08:40:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 08:40:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016919940] [2022-04-08 08:40:38,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016919940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:38,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:38,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047836153] [2022-04-08 08:40:38,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047836153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:38,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946217635] [2022-04-08 08:40:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:38,917 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 155 [2022-04-08 08:40:38,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:38,917 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:39,009 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:39,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:39,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:39,010 INFO L87 Difference]: Start difference. First operand 867 states and 1239 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:40:41,028 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:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:42,396 INFO L93 Difference]: Finished difference Result 1937 states and 2787 transitions. [2022-04-08 08:40:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:42,396 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 155 [2022-04-08 08:40:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:42,396 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:40:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-08 08:40:42,398 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:40:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-08 08:40:42,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-08 08:40:42,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:42,685 INFO L225 Difference]: With dead ends: 1937 [2022-04-08 08:40:42,685 INFO L226 Difference]: Without dead ends: 1086 [2022-04-08 08:40:42,686 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:42,687 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 83 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:42,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 539 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:40:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2022-04-08 08:40:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 867. [2022-04-08 08:40:42,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:42,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1086 states. Second operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call 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:42,726 INFO L74 IsIncluded]: Start isIncluded. First operand 1086 states. Second operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call 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:42,726 INFO L87 Difference]: Start difference. First operand 1086 states. Second operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call 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:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:42,756 INFO L93 Difference]: Finished difference Result 1086 states and 1564 transitions. [2022-04-08 08:40:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1564 transitions. [2022-04-08 08:40:42,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:42,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:42,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 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 1086 states. [2022-04-08 08:40:42,758 INFO L87 Difference]: Start difference. First operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 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 1086 states. [2022-04-08 08:40:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:42,788 INFO L93 Difference]: Finished difference Result 1086 states and 1564 transitions. [2022-04-08 08:40:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1564 transitions. [2022-04-08 08:40:42,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:42,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:42,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:42,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 862 states have (on average 1.4280742459396751) internal successors, (1231), 862 states have internal predecessors, (1231), 3 states have call successors, (3), 3 states have call 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:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1235 transitions. [2022-04-08 08:40:42,832 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1235 transitions. Word has length 155 [2022-04-08 08:40:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:42,833 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1235 transitions. [2022-04-08 08:40:42,833 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:40:42,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 867 states and 1235 transitions. [2022-04-08 08:40:43,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1235 edges. 1235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1235 transitions. [2022-04-08 08:40:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:40:43,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:43,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:40:43,827 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1227152319, now seen corresponding path program 1 times [2022-04-08 08:40:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:43,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1263230286] [2022-04-08 08:40:56,809 WARN L232 SmtUtils]: Spent 8.49s 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:03,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1227152319, now seen corresponding path program 2 times [2022-04-08 08:41:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:03,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200570829] [2022-04-08 08:41:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:03,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {84497#(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); {84490#true} is VALID [2022-04-08 08:41:03,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {84490#true} assume true; {84490#true} is VALID [2022-04-08 08:41:03,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84490#true} {84490#true} #593#return; {84490#true} is VALID [2022-04-08 08:41:03,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {84490#true} call ULTIMATE.init(); {84497#(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:03,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {84497#(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); {84490#true} is VALID [2022-04-08 08:41:03,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {84490#true} assume true; {84490#true} is VALID [2022-04-08 08:41:03,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84490#true} {84490#true} #593#return; {84490#true} is VALID [2022-04-08 08:41:03,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {84490#true} call #t~ret158 := main(); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {84490#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {84490#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); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {84490#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {84490#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {84490#true} assume 12292 == #t~mem49;havoc #t~mem49; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {84490#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {84490#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {84490#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {84490#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); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {84490#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {84490#true} assume !(0 == ~tmp___4~0); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {84490#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); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {84490#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {84490#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {84490#true} assume 4368 == #t~mem54;havoc #t~mem54; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {84490#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {84490#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); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {84490#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {84490#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {84490#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {84490#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {84490#true} assume 4384 == #t~mem56;havoc #t~mem56; {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {84490#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {84490#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {84490#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {84490#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {84490#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {84490#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-08 08:41:03,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {84490#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 64: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 65: Hoare triple {84490#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 66: Hoare triple {84490#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 67: Hoare triple {84490#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {84490#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 69: Hoare triple {84490#true} assume 4400 == #t~mem58;havoc #t~mem58; {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 70: Hoare triple {84490#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); {84490#true} is VALID [2022-04-08 08:41:03,610 INFO L290 TraceCheckUtils]: 71: Hoare triple {84490#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; {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 72: Hoare triple {84490#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 73: Hoare triple {84490#true} assume !(~ret~0 <= 0); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 74: Hoare triple {84490#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {84490#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 76: Hoare triple {84490#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 77: Hoare triple {84490#true} ~skip~0 := 0; {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 78: Hoare triple {84490#true} assume !false; {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 79: Hoare triple {84490#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {84490#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 81: Hoare triple {84490#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 82: Hoare triple {84490#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 83: Hoare triple {84490#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 84: Hoare triple {84490#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,611 INFO L290 TraceCheckUtils]: 85: Hoare triple {84490#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 86: Hoare triple {84490#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 87: Hoare triple {84490#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 88: Hoare triple {84490#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 89: Hoare triple {84490#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 90: Hoare triple {84490#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 91: Hoare triple {84490#true} assume 4416 == #t~mem60;havoc #t~mem60; {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 92: Hoare triple {84490#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {84490#true} is VALID [2022-04-08 08:41:03,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {84490#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {84490#true} is VALID [2022-04-08 08:41:03,613 INFO L290 TraceCheckUtils]: 94: Hoare triple {84490#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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,613 INFO L290 TraceCheckUtils]: 95: Hoare triple {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,613 INFO L290 TraceCheckUtils]: 96: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,614 INFO L290 TraceCheckUtils]: 97: Hoare triple {84495#(= 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; {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,614 INFO L290 TraceCheckUtils]: 98: Hoare triple {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,614 INFO L290 TraceCheckUtils]: 99: Hoare triple {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,614 INFO L290 TraceCheckUtils]: 100: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,615 INFO L290 TraceCheckUtils]: 101: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,615 INFO L290 TraceCheckUtils]: 102: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,615 INFO L290 TraceCheckUtils]: 103: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,616 INFO L290 TraceCheckUtils]: 104: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,616 INFO L290 TraceCheckUtils]: 105: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,616 INFO L290 TraceCheckUtils]: 106: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,616 INFO L290 TraceCheckUtils]: 107: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,617 INFO L290 TraceCheckUtils]: 108: Hoare triple {84495#(= 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); {84495#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:03,617 INFO L290 TraceCheckUtils]: 109: Hoare triple {84495#(= 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); {84496#(= |ssl3_connect_#t~mem58| 4432)} is VALID [2022-04-08 08:41:03,617 INFO L290 TraceCheckUtils]: 110: Hoare triple {84496#(= |ssl3_connect_#t~mem58| 4432)} assume 4400 == #t~mem58;havoc #t~mem58; {84491#false} is VALID [2022-04-08 08:41:03,617 INFO L290 TraceCheckUtils]: 111: Hoare triple {84491#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); {84491#false} is VALID [2022-04-08 08:41:03,617 INFO L290 TraceCheckUtils]: 112: Hoare triple {84491#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;~skip~0 := 1; {84491#false} is VALID [2022-04-08 08:41:03,617 INFO L290 TraceCheckUtils]: 113: Hoare triple {84491#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 114: Hoare triple {84491#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); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 115: Hoare triple {84491#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 116: Hoare triple {84491#false} ~skip~0 := 0; {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 117: Hoare triple {84491#false} assume !false; {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 118: Hoare triple {84491#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); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 119: Hoare triple {84491#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 120: Hoare triple {84491#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 121: Hoare triple {84491#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 122: Hoare triple {84491#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 123: Hoare triple {84491#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 124: Hoare triple {84491#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 125: Hoare triple {84491#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 126: Hoare triple {84491#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,618 INFO L290 TraceCheckUtils]: 127: Hoare triple {84491#false} assume 4385 == #t~mem57;havoc #t~mem57; {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 128: Hoare triple {84491#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 129: Hoare triple {84491#false} assume !(1 == ~blastFlag~0); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 130: Hoare triple {84491#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 131: Hoare triple {84491#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 132: Hoare triple {84491#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 133: Hoare triple {84491#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 134: Hoare triple {84491#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); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 135: Hoare triple {84491#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 136: Hoare triple {84491#false} ~skip~0 := 0; {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 137: Hoare triple {84491#false} assume !false; {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 138: Hoare triple {84491#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); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 139: Hoare triple {84491#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,619 INFO L290 TraceCheckUtils]: 140: Hoare triple {84491#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 141: Hoare triple {84491#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 142: Hoare triple {84491#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 143: Hoare triple {84491#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 144: Hoare triple {84491#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 145: Hoare triple {84491#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 146: Hoare triple {84491#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 147: Hoare triple {84491#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 148: Hoare triple {84491#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 149: Hoare triple {84491#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 150: Hoare triple {84491#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 151: Hoare triple {84491#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 152: Hoare triple {84491#false} assume 4432 == #t~mem62;havoc #t~mem62; {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 153: Hoare triple {84491#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {84491#false} is VALID [2022-04-08 08:41:03,620 INFO L290 TraceCheckUtils]: 154: Hoare triple {84491#false} assume 5 == ~blastFlag~0; {84491#false} is VALID [2022-04-08 08:41:03,621 INFO L290 TraceCheckUtils]: 155: Hoare triple {84491#false} assume !false; {84491#false} is VALID [2022-04-08 08:41:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 08:41:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200570829] [2022-04-08 08:41:03,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200570829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:03,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:03,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:03,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1263230286] [2022-04-08 08:41:03,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1263230286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:03,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:03,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806040172] [2022-04-08 08:41:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:03,622 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 156 [2022-04-08 08:41:03,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:03,622 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:03,695 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:03,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:03,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:03,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:03,696 INFO L87 Difference]: Start difference. First operand 867 states and 1235 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:05,716 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:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:07,038 INFO L93 Difference]: Finished difference Result 1937 states and 2779 transitions. [2022-04-08 08:41:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:07,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:41:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:07,038 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:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 08:41:07,040 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:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 08:41:07,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-08 08:41:07,330 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:41:07,382 INFO L225 Difference]: With dead ends: 1937 [2022-04-08 08:41:07,382 INFO L226 Difference]: Without dead ends: 1086 [2022-04-08 08:41:07,383 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:07,383 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 77 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:07,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 537 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:41:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2022-04-08 08:41:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 871. [2022-04-08 08:41:07,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:07,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:07,425 INFO L74 IsIncluded]: Start isIncluded. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:07,426 INFO L87 Difference]: Start difference. First operand 1086 states. Second operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:07,455 INFO L93 Difference]: Finished difference Result 1086 states and 1560 transitions. [2022-04-08 08:41:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1560 transitions. [2022-04-08 08:41:07,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:07,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:07,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 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 1086 states. [2022-04-08 08:41:07,457 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 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 1086 states. [2022-04-08 08:41:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:07,487 INFO L93 Difference]: Finished difference Result 1086 states and 1560 transitions. [2022-04-08 08:41:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1560 transitions. [2022-04-08 08:41:07,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:07,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:07,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:07,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.426096997690531) internal successors, (1235), 866 states have internal predecessors, (1235), 3 states have call successors, (3), 3 states have call 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:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1239 transitions. [2022-04-08 08:41:07,516 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1239 transitions. Word has length 156 [2022-04-08 08:41:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:07,516 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1239 transitions. [2022-04-08 08:41:07,516 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:07,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1239 transitions. [2022-04-08 08:41:08,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1239 edges. 1239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1239 transitions. [2022-04-08 08:41:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 08:41:08,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:08,655 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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] [2022-04-08 08:41:08,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:41:08,655 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -35280706, now seen corresponding path program 1 times [2022-04-08 08:41:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063675772] [2022-04-08 08:41:20,696 WARN L232 SmtUtils]: Spent 7.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:41:26,898 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash -35280706, now seen corresponding path program 2 times [2022-04-08 08:41:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:26,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213342187] [2022-04-08 08:41:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:27,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {92297#(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); {92290#true} is VALID [2022-04-08 08:41:27,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {92290#true} assume true; {92290#true} is VALID [2022-04-08 08:41:27,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92290#true} {92290#true} #593#return; {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {92290#true} call ULTIMATE.init(); {92297#(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:27,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {92297#(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); {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {92290#true} assume true; {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92290#true} {92290#true} #593#return; {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {92290#true} call #t~ret158 := main(); {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {92290#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {92290#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); {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {92290#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {92290#true} is VALID [2022-04-08 08:41:27,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {92290#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {92290#true} assume 12292 == #t~mem49;havoc #t~mem49; {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {92290#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {92290#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {92290#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {92290#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); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {92290#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {92290#true} assume !(0 == ~tmp___4~0); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {92290#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); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {92290#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-08 08:41:27,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {92290#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {92290#true} assume 4368 == #t~mem54;havoc #t~mem54; {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {92290#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {92290#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); {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {92290#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {92290#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {92290#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {92290#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {92290#true} assume 4384 == #t~mem56;havoc #t~mem56; {92290#true} is VALID [2022-04-08 08:41:27,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {92290#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {92290#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {92290#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {92290#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {92290#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {92290#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {92290#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {92290#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {92290#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {92290#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {92290#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {92290#true} assume 4400 == #t~mem58;havoc #t~mem58; {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {92290#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); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {92290#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; {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {92290#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {92290#true} assume !(~ret~0 <= 0); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 74: Hoare triple {92290#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 75: Hoare triple {92290#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {92290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {92290#true} ~skip~0 := 0; {92290#true} is VALID [2022-04-08 08:41:27,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {92290#true} assume !false; {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {92290#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {92290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {92290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {92290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {92290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {92290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {92290#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {92290#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {92290#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {92290#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {92290#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {92290#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {92290#true} assume 4416 == #t~mem60;havoc #t~mem60; {92290#true} is VALID [2022-04-08 08:41:27,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {92290#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {92290#true} is VALID [2022-04-08 08:41:27,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {92290#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {92290#true} is VALID [2022-04-08 08:41:27,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {92290#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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,081 INFO L290 TraceCheckUtils]: 95: Hoare triple {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,082 INFO L290 TraceCheckUtils]: 97: Hoare triple {92295#(not (= 4401 (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; {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,082 INFO L290 TraceCheckUtils]: 99: Hoare triple {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,083 INFO L290 TraceCheckUtils]: 101: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,083 INFO L290 TraceCheckUtils]: 102: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,083 INFO L290 TraceCheckUtils]: 103: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,084 INFO L290 TraceCheckUtils]: 104: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 109: Hoare triple {92295#(not (= 4401 (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); {92295#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 110: Hoare triple {92295#(not (= 4401 (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); {92296#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 111: Hoare triple {92296#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {92291#false} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 112: Hoare triple {92291#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); {92291#false} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 113: Hoare triple {92291#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;~skip~0 := 1; {92291#false} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 114: Hoare triple {92291#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,086 INFO L290 TraceCheckUtils]: 115: Hoare triple {92291#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); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {92291#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 117: Hoare triple {92291#false} ~skip~0 := 0; {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 118: Hoare triple {92291#false} assume !false; {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 119: Hoare triple {92291#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); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 120: Hoare triple {92291#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 121: Hoare triple {92291#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 122: Hoare triple {92291#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 123: Hoare triple {92291#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 124: Hoare triple {92291#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 125: Hoare triple {92291#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 126: Hoare triple {92291#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 127: Hoare triple {92291#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 128: Hoare triple {92291#false} assume 4385 == #t~mem57;havoc #t~mem57; {92291#false} is VALID [2022-04-08 08:41:27,087 INFO L290 TraceCheckUtils]: 129: Hoare triple {92291#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 130: Hoare triple {92291#false} assume !(1 == ~blastFlag~0); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 131: Hoare triple {92291#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 132: Hoare triple {92291#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 133: Hoare triple {92291#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 134: Hoare triple {92291#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 135: Hoare triple {92291#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); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 136: Hoare triple {92291#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 137: Hoare triple {92291#false} ~skip~0 := 0; {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 138: Hoare triple {92291#false} assume !false; {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 139: Hoare triple {92291#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); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 140: Hoare triple {92291#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 141: Hoare triple {92291#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 142: Hoare triple {92291#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,088 INFO L290 TraceCheckUtils]: 143: Hoare triple {92291#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 144: Hoare triple {92291#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 145: Hoare triple {92291#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 146: Hoare triple {92291#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 147: Hoare triple {92291#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 148: Hoare triple {92291#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 149: Hoare triple {92291#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 150: Hoare triple {92291#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 151: Hoare triple {92291#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 152: Hoare triple {92291#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 153: Hoare triple {92291#false} assume 4432 == #t~mem62;havoc #t~mem62; {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 154: Hoare triple {92291#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 155: Hoare triple {92291#false} assume 5 == ~blastFlag~0; {92291#false} is VALID [2022-04-08 08:41:27,089 INFO L290 TraceCheckUtils]: 156: Hoare triple {92291#false} assume !false; {92291#false} is VALID [2022-04-08 08:41:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 08:41:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213342187] [2022-04-08 08:41:27,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213342187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:27,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:27,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:27,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063675772] [2022-04-08 08:41:27,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063675772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:27,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:27,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648428540] [2022-04-08 08:41:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:27,091 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 157 [2022-04-08 08:41:27,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:27,091 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:27,162 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:27,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:27,163 INFO L87 Difference]: Start difference. First operand 871 states and 1239 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:29,182 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:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:30,318 INFO L93 Difference]: Finished difference Result 2085 states and 2976 transitions. [2022-04-08 08:41:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:30,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 157 [2022-04-08 08:41:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:30,319 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:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 08:41:30,322 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:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 08:41:30,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 08:41:30,641 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:41:30,712 INFO L225 Difference]: With dead ends: 2085 [2022-04-08 08:41:30,712 INFO L226 Difference]: Without dead ends: 1230 [2022-04-08 08:41:30,713 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:30,713 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 107 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 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:41:30,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 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:41:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-04-08 08:41:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 886. [2022-04-08 08:41:30,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:30,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call 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:30,760 INFO L74 IsIncluded]: Start isIncluded. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call 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:30,761 INFO L87 Difference]: Start difference. First operand 1230 states. Second operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call 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:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:30,797 INFO L93 Difference]: Finished difference Result 1230 states and 1752 transitions. [2022-04-08 08:41:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1752 transitions. [2022-04-08 08:41:30,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:30,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:30,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 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 1230 states. [2022-04-08 08:41:30,799 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 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 1230 states. [2022-04-08 08:41:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:30,836 INFO L93 Difference]: Finished difference Result 1230 states and 1752 transitions. [2022-04-08 08:41:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1752 transitions. [2022-04-08 08:41:30,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:30,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:30,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:30,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4301929625425653) internal successors, (1260), 881 states have internal predecessors, (1260), 3 states have call successors, (3), 3 states have call 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:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1264 transitions. [2022-04-08 08:41:30,866 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1264 transitions. Word has length 157 [2022-04-08 08:41:30,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:30,866 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1264 transitions. [2022-04-08 08:41:30,866 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:30,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1264 transitions. [2022-04-08 08:41:32,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1264 edges. 1264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1264 transitions. [2022-04-08 08:41:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-08 08:41:32,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:32,092 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:32,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:41:32,092 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:32,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1137385555, now seen corresponding path program 1 times [2022-04-08 08:41:32,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:32,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387161346] [2022-04-08 08:41:47,851 WARN L232 SmtUtils]: Spent 11.13s 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:54,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1137385555, now seen corresponding path program 2 times [2022-04-08 08:41:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:54,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88451121] [2022-04-08 08:41:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:55,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {100714#(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); {100704#true} is VALID [2022-04-08 08:41:55,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-08 08:41:55,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {100704#true} call ULTIMATE.init(); {100714#(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:55,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {100714#(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); {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {100704#true} call #t~ret158 := main(); {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {100704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {100704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100704#true} is VALID [2022-04-08 08:41:55,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {100704#true} assume 12292 == #t~mem49;havoc #t~mem49; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {100704#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {100704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {100704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {100704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {100704#true} assume !(0 == ~tmp___4~0); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {100704#true} assume 4368 == #t~mem54;havoc #t~mem54; {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {100704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:41:55,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {100704#true} assume 4384 == #t~mem56;havoc #t~mem56; {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {100704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {100704#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {100704#true} assume 4400 == #t~mem58;havoc #t~mem58; {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {100704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {100704#true} assume !(~ret~0 <= 0); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {100704#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 81: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 82: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 90: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {100704#true} assume 4416 == #t~mem60;havoc #t~mem60; {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {100704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {100704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {100704#true} assume !(0 == ~tmp___6~0); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 99: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 100: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 104: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 107: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 108: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,046 INFO L290 TraceCheckUtils]: 109: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100709#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:55,047 INFO L290 TraceCheckUtils]: 110: Hoare triple {100709#(= |ssl3_connect_#t~mem58| (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); {100710#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,047 INFO L290 TraceCheckUtils]: 111: Hoare triple {100710#(not (= 4400 (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); {100710#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,047 INFO L290 TraceCheckUtils]: 112: Hoare triple {100710#(not (= 4400 (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); {100710#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 113: Hoare triple {100710#(not (= 4400 (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); {100711#(not (= |ssl3_connect_#t~mem62| 4400))} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {100711#(not (= |ssl3_connect_#t~mem62| 4400))} assume 4432 == #t~mem62;havoc #t~mem62; {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 115: Hoare triple {100704#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {100704#true} assume !(5 == ~blastFlag~0); {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 119: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 120: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 121: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 122: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 124: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 125: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 126: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 127: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 128: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 129: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 130: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 131: Hoare triple {100704#true} assume 4385 == #t~mem57;havoc #t~mem57; {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 132: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 133: Hoare triple {100704#true} assume !(1 == ~blastFlag~0); {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 134: Hoare triple {100704#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100704#true} is VALID [2022-04-08 08:41:55,049 INFO L290 TraceCheckUtils]: 135: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:41:55,050 INFO L290 TraceCheckUtils]: 136: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,051 INFO L290 TraceCheckUtils]: 138: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,051 INFO L290 TraceCheckUtils]: 139: Hoare triple {100712#(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; {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,051 INFO L290 TraceCheckUtils]: 140: Hoare triple {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,052 INFO L290 TraceCheckUtils]: 141: Hoare triple {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,052 INFO L290 TraceCheckUtils]: 142: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,052 INFO L290 TraceCheckUtils]: 143: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,052 INFO L290 TraceCheckUtils]: 144: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,053 INFO L290 TraceCheckUtils]: 145: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,053 INFO L290 TraceCheckUtils]: 146: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,053 INFO L290 TraceCheckUtils]: 147: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,053 INFO L290 TraceCheckUtils]: 148: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,054 INFO L290 TraceCheckUtils]: 149: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,054 INFO L290 TraceCheckUtils]: 150: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,054 INFO L290 TraceCheckUtils]: 151: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,054 INFO L290 TraceCheckUtils]: 152: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,055 INFO L290 TraceCheckUtils]: 153: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,055 INFO L290 TraceCheckUtils]: 154: Hoare triple {100712#(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); {100712#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:41:55,055 INFO L290 TraceCheckUtils]: 155: Hoare triple {100712#(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); {100713#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-08 08:41:55,055 INFO L290 TraceCheckUtils]: 156: Hoare triple {100713#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {100705#false} is VALID [2022-04-08 08:41:55,056 INFO L290 TraceCheckUtils]: 157: Hoare triple {100705#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100705#false} is VALID [2022-04-08 08:41:55,056 INFO L290 TraceCheckUtils]: 158: Hoare triple {100705#false} assume 5 == ~blastFlag~0; {100705#false} is VALID [2022-04-08 08:41:55,056 INFO L290 TraceCheckUtils]: 159: Hoare triple {100705#false} assume !false; {100705#false} is VALID [2022-04-08 08:41:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-08 08:41:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:55,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88451121] [2022-04-08 08:41:55,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88451121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:41:55,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928726620] [2022-04-08 08:41:55,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:41:55,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:41:55,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:41:55,058 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:41:55,062 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:43:30,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:43:30,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:43:30,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 08:43:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:30,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:43:30,231 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:43:30,231 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:43:30,235 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:43:30,240 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:43:30,247 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:43:30,430 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-08 08:43:30,431 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:43:30,441 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:43:30,456 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:43:30,528 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:43:30,528 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:43:30,745 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-08 08:43:30,777 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:43:30,778 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-08 08:43:30,893 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:43:30,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {100704#true} call ULTIMATE.init(); {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {100704#true} call #t~ret158 := main(); {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {100704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100704#true} is VALID [2022-04-08 08:43:30,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {100704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {100704#true} assume 12292 == #t~mem49;havoc #t~mem49; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {100704#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {100704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {100704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {100704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {100704#true} is VALID [2022-04-08 08:43:30,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {100704#true} assume !(0 == ~tmp___4~0); {100704#true} is VALID [2022-04-08 08:43:30,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {100704#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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {100781#(= 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; {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {100781#(= 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); {100781#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {100781#(= 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); {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {100704#true} assume 4368 == #t~mem54;havoc #t~mem54; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {100704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:30,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {100704#true} assume 4384 == #t~mem56;havoc #t~mem56; {100704#true} is VALID [2022-04-08 08:43:30,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {100704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {100704#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 69: Hoare triple {100704#true} assume 4400 == #t~mem58;havoc #t~mem58; {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {100704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100704#true} is VALID [2022-04-08 08:43:30,924 INFO L290 TraceCheckUtils]: 73: Hoare triple {100704#true} assume !(~ret~0 <= 0); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {100704#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 78: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 79: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 80: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 81: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 82: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 83: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 84: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 85: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 86: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,925 INFO L290 TraceCheckUtils]: 87: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 88: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 89: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 90: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 91: Hoare triple {100704#true} assume 4416 == #t~mem60;havoc #t~mem60; {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 92: Hoare triple {100704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 93: Hoare triple {100704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 94: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 95: Hoare triple {100704#true} assume !(0 == ~tmp___6~0); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 96: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 97: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 98: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 99: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 100: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 101: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,926 INFO L290 TraceCheckUtils]: 102: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 103: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 104: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 105: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 106: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 107: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 108: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 109: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 110: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 111: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 112: Hoare triple {100704#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 113: Hoare triple {100704#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 114: Hoare triple {100704#true} assume 4432 == #t~mem62;havoc #t~mem62; {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 115: Hoare triple {100704#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100704#true} is VALID [2022-04-08 08:43:30,927 INFO L290 TraceCheckUtils]: 116: Hoare triple {100704#true} assume !(5 == ~blastFlag~0); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 117: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 118: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 119: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 120: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 121: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 122: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 123: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 124: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 125: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 126: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 127: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 128: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 129: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 130: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,928 INFO L290 TraceCheckUtils]: 131: Hoare triple {100704#true} assume 4385 == #t~mem57;havoc #t~mem57; {100704#true} is VALID [2022-04-08 08:43:30,929 INFO L290 TraceCheckUtils]: 132: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-08 08:43:30,929 INFO L290 TraceCheckUtils]: 133: Hoare triple {100704#true} assume !(1 == ~blastFlag~0); {100704#true} is VALID [2022-04-08 08:43:30,929 INFO L290 TraceCheckUtils]: 134: Hoare triple {100704#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100704#true} is VALID [2022-04-08 08:43:30,929 INFO L290 TraceCheckUtils]: 135: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:30,929 INFO L290 TraceCheckUtils]: 136: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,930 INFO L290 TraceCheckUtils]: 137: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,930 INFO L290 TraceCheckUtils]: 138: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,931 INFO L290 TraceCheckUtils]: 139: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,931 INFO L290 TraceCheckUtils]: 140: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} ~skip~0 := 0; {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,931 INFO L290 TraceCheckUtils]: 141: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !false; {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,932 INFO L290 TraceCheckUtils]: 142: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,932 INFO L290 TraceCheckUtils]: 143: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,932 INFO L290 TraceCheckUtils]: 144: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,932 INFO L290 TraceCheckUtils]: 145: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,933 INFO L290 TraceCheckUtils]: 146: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,933 INFO L290 TraceCheckUtils]: 147: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,933 INFO L290 TraceCheckUtils]: 148: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,934 INFO L290 TraceCheckUtils]: 149: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,934 INFO L290 TraceCheckUtils]: 150: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,934 INFO L290 TraceCheckUtils]: 151: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,934 INFO L290 TraceCheckUtils]: 152: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,935 INFO L290 TraceCheckUtils]: 153: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,935 INFO L290 TraceCheckUtils]: 154: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} is VALID [2022-04-08 08:43:30,935 INFO L290 TraceCheckUtils]: 155: Hoare triple {101127#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4400)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {101185#(<= |ssl3_connect_#t~mem62| 4400)} is VALID [2022-04-08 08:43:30,936 INFO L290 TraceCheckUtils]: 156: Hoare triple {101185#(<= |ssl3_connect_#t~mem62| 4400)} assume 4432 == #t~mem62;havoc #t~mem62; {100705#false} is VALID [2022-04-08 08:43:30,936 INFO L290 TraceCheckUtils]: 157: Hoare triple {100705#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100705#false} is VALID [2022-04-08 08:43:30,936 INFO L290 TraceCheckUtils]: 158: Hoare triple {100705#false} assume 5 == ~blastFlag~0; {100705#false} is VALID [2022-04-08 08:43:30,936 INFO L290 TraceCheckUtils]: 159: Hoare triple {100705#false} assume !false; {100705#false} is VALID [2022-04-08 08:43:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 60 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-08 08:43:30,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:43:31,233 INFO L290 TraceCheckUtils]: 159: Hoare triple {100705#false} assume !false; {100705#false} is VALID [2022-04-08 08:43:31,234 INFO L290 TraceCheckUtils]: 158: Hoare triple {100705#false} assume 5 == ~blastFlag~0; {100705#false} is VALID [2022-04-08 08:43:31,234 INFO L290 TraceCheckUtils]: 157: Hoare triple {100705#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100705#false} is VALID [2022-04-08 08:43:31,234 INFO L290 TraceCheckUtils]: 156: Hoare triple {101207#(not (<= 4432 |ssl3_connect_#t~mem62|))} assume 4432 == #t~mem62;havoc #t~mem62; {100705#false} is VALID [2022-04-08 08:43:31,234 INFO L290 TraceCheckUtils]: 155: Hoare triple {101211#(< (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); {101207#(not (<= 4432 |ssl3_connect_#t~mem62|))} is VALID [2022-04-08 08:43:31,235 INFO L290 TraceCheckUtils]: 154: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,235 INFO L290 TraceCheckUtils]: 153: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,235 INFO L290 TraceCheckUtils]: 152: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,235 INFO L290 TraceCheckUtils]: 151: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,236 INFO L290 TraceCheckUtils]: 150: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,236 INFO L290 TraceCheckUtils]: 149: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,236 INFO L290 TraceCheckUtils]: 148: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,237 INFO L290 TraceCheckUtils]: 147: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,237 INFO L290 TraceCheckUtils]: 146: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,237 INFO L290 TraceCheckUtils]: 145: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,237 INFO L290 TraceCheckUtils]: 144: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,238 INFO L290 TraceCheckUtils]: 143: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,238 INFO L290 TraceCheckUtils]: 142: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,238 INFO L290 TraceCheckUtils]: 141: Hoare triple {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !false; {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,238 INFO L290 TraceCheckUtils]: 140: Hoare triple {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} ~skip~0 := 0; {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,239 INFO L290 TraceCheckUtils]: 139: Hoare triple {101211#(< (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; {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,239 INFO L290 TraceCheckUtils]: 138: Hoare triple {101211#(< (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); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,240 INFO L290 TraceCheckUtils]: 137: Hoare triple {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,240 INFO L290 TraceCheckUtils]: 136: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {101211#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-08 08:43:31,240 INFO L290 TraceCheckUtils]: 135: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,240 INFO L290 TraceCheckUtils]: 134: Hoare triple {100704#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {100704#true} is VALID [2022-04-08 08:43:31,240 INFO L290 TraceCheckUtils]: 133: Hoare triple {100704#true} assume !(1 == ~blastFlag~0); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 132: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 131: Hoare triple {100704#true} assume 4385 == #t~mem57;havoc #t~mem57; {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 130: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 129: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 128: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 127: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 126: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 125: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 124: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 123: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 122: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 121: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 120: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:31,241 INFO L290 TraceCheckUtils]: 119: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 118: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 117: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 116: Hoare triple {100704#true} assume !(5 == ~blastFlag~0); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 115: Hoare triple {100704#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 114: Hoare triple {100704#true} assume 4432 == #t~mem62;havoc #t~mem62; {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 113: Hoare triple {100704#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {100704#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 107: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 106: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 105: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,242 INFO L290 TraceCheckUtils]: 104: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 103: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 102: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 101: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 100: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 99: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 98: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 97: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 96: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 95: Hoare triple {100704#true} assume !(0 == ~tmp___6~0); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 94: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 93: Hoare triple {100704#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 92: Hoare triple {100704#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 91: Hoare triple {100704#true} assume 4416 == #t~mem60;havoc #t~mem60; {100704#true} is VALID [2022-04-08 08:43:31,243 INFO L290 TraceCheckUtils]: 90: Hoare triple {100704#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,267 INFO L290 TraceCheckUtils]: 89: Hoare triple {100704#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,267 INFO L290 TraceCheckUtils]: 88: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,267 INFO L290 TraceCheckUtils]: 87: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 83: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 82: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 81: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 79: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 78: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 77: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 76: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 75: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {100704#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {100704#true} assume !(~ret~0 <= 0); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {100704#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {100704#true} assume 4400 == #t~mem58;havoc #t~mem58; {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {100704#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {100704#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 64: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {100704#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {100704#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {100704#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {100704#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {100704#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {100704#true} assume 4384 == #t~mem56;havoc #t~mem56; {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {100704#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {100704#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {100704#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {100704#true} assume 4368 == #t~mem54;havoc #t~mem54; {100704#true} is VALID [2022-04-08 08:43:31,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {100704#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {100704#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {100704#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {100704#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {100704#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {100704#true} ~skip~0 := 0; {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {100704#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {100704#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {100704#true} assume !(0 == ~tmp___4~0); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {100704#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {100704#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {100704#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {100704#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {100704#true} assume 12292 == #t~mem49;havoc #t~mem49; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {100704#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {100704#true} assume !false; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {100704#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L272 TraceCheckUtils]: 6: Hoare triple {100704#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {100704#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; {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {100704#true} call #t~ret158 := main(); {100704#true} is VALID [2022-04-08 08:43:31,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100704#true} {100704#true} #593#return; {100704#true} is VALID [2022-04-08 08:43:31,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {100704#true} assume true; {100704#true} is VALID [2022-04-08 08:43:31,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {100704#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); {100704#true} is VALID [2022-04-08 08:43:31,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {100704#true} call ULTIMATE.init(); {100704#true} is VALID [2022-04-08 08:43:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-08 08:43:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928726620] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:43:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:43:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-08 08:43:31,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:31,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387161346] [2022-04-08 08:43:31,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387161346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:31,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:31,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:43:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835032648] [2022-04-08 08:43:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:31,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-08 08:43:31,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:31,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:31,337 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:31,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:43:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:43:31,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:43:31,337 INFO L87 Difference]: Start difference. First operand 886 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:37,409 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:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:38,549 INFO L93 Difference]: Finished difference Result 2213 states and 3154 transitions. [2022-04-08 08:43:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:43:38,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-08 08:43:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:43:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:43:38,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-08 08:43:38,867 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:43:38,932 INFO L225 Difference]: With dead ends: 2213 [2022-04-08 08:43:38,932 INFO L226 Difference]: Without dead ends: 1343 [2022-04-08 08:43:38,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 319 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:38,935 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 94 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:38,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 314 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:43:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-04-08 08:43:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1015. [2022-04-08 08:43:39,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:39,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1343 states. Second operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call 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:39,237 INFO L74 IsIncluded]: Start isIncluded. First operand 1343 states. Second operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call 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:39,238 INFO L87 Difference]: Start difference. First operand 1343 states. Second operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call 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:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:39,281 INFO L93 Difference]: Finished difference Result 1343 states and 1905 transitions. [2022-04-08 08:43:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1905 transitions. [2022-04-08 08:43:39,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:39,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:39,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 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 1343 states. [2022-04-08 08:43:39,285 INFO L87 Difference]: Start difference. First operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 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 1343 states. [2022-04-08 08:43:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:39,328 INFO L93 Difference]: Finished difference Result 1343 states and 1905 transitions. [2022-04-08 08:43:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1905 transitions. [2022-04-08 08:43:39,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:39,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:39,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:39,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1010 states have (on average 1.4297029702970296) internal successors, (1444), 1010 states have internal predecessors, (1444), 3 states have call successors, (3), 3 states have call 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:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1448 transitions. [2022-04-08 08:43:39,368 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1448 transitions. Word has length 160 [2022-04-08 08:43:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:39,368 INFO L478 AbstractCegarLoop]: Abstraction has 1015 states and 1448 transitions. [2022-04-08 08:43:39,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:39,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1015 states and 1448 transitions. [2022-04-08 08:43:40,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1448 transitions. [2022-04-08 08:43:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-08 08:43:40,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:40,670 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 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] [2022-04-08 08:43:40,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 08:43:40,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 08:43:40,884 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1271399061, now seen corresponding path program 1 times [2022-04-08 08:43:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:40,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24817193] [2022-04-08 08:43:53,403 WARN L232 SmtUtils]: Spent 7.84s 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:00,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1271399061, now seen corresponding path program 2 times [2022-04-08 08:44:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:00,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792225002] [2022-04-08 08:44:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:00,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {110831#(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); {110823#true} is VALID [2022-04-08 08:44:00,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-08 08:44:00,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {110823#true} call ULTIMATE.init(); {110831#(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:00,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {110831#(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); {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {110823#true} call #t~ret158 := main(); {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {110823#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:00,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {110823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {110823#true} assume 12292 == #t~mem49;havoc #t~mem49; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {110823#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {110823#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {110823#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {110823#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {110823#true} assume !(0 == ~tmp___4~0); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:00,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {110823#true} assume 4368 == #t~mem54;havoc #t~mem54; {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {110823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {110823#true} assume 4384 == #t~mem56;havoc #t~mem56; {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-08 08:44:00,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {110823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110823#true} is VALID [2022-04-08 08:44:00,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110828#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:00,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {110828#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,658 INFO L290 TraceCheckUtils]: 60: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,658 INFO L290 TraceCheckUtils]: 62: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,658 INFO L290 TraceCheckUtils]: 63: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,660 INFO L290 TraceCheckUtils]: 69: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem58;havoc #t~mem58; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,660 INFO L290 TraceCheckUtils]: 70: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,660 INFO L290 TraceCheckUtils]: 71: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,663 INFO L290 TraceCheckUtils]: 77: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,663 INFO L290 TraceCheckUtils]: 80: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,664 INFO L290 TraceCheckUtils]: 81: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,664 INFO L290 TraceCheckUtils]: 82: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,664 INFO L290 TraceCheckUtils]: 83: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,664 INFO L290 TraceCheckUtils]: 84: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,665 INFO L290 TraceCheckUtils]: 85: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,665 INFO L290 TraceCheckUtils]: 86: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,665 INFO L290 TraceCheckUtils]: 87: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,665 INFO L290 TraceCheckUtils]: 88: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,666 INFO L290 TraceCheckUtils]: 89: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,666 INFO L290 TraceCheckUtils]: 90: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,666 INFO L290 TraceCheckUtils]: 91: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem60;havoc #t~mem60; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,666 INFO L290 TraceCheckUtils]: 92: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,667 INFO L290 TraceCheckUtils]: 93: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,668 INFO L290 TraceCheckUtils]: 94: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,668 INFO L290 TraceCheckUtils]: 95: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,668 INFO L290 TraceCheckUtils]: 96: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,668 INFO L290 TraceCheckUtils]: 97: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,669 INFO L290 TraceCheckUtils]: 98: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,669 INFO L290 TraceCheckUtils]: 99: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,669 INFO L290 TraceCheckUtils]: 100: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,669 INFO L290 TraceCheckUtils]: 101: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,670 INFO L290 TraceCheckUtils]: 102: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,670 INFO L290 TraceCheckUtils]: 103: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,670 INFO L290 TraceCheckUtils]: 104: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,670 INFO L290 TraceCheckUtils]: 105: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,671 INFO L290 TraceCheckUtils]: 106: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,671 INFO L290 TraceCheckUtils]: 107: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,671 INFO L290 TraceCheckUtils]: 108: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,672 INFO L290 TraceCheckUtils]: 109: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,672 INFO L290 TraceCheckUtils]: 110: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,672 INFO L290 TraceCheckUtils]: 111: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,672 INFO L290 TraceCheckUtils]: 112: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,673 INFO L290 TraceCheckUtils]: 113: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,673 INFO L290 TraceCheckUtils]: 114: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4432 == #t~mem62;havoc #t~mem62; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,673 INFO L290 TraceCheckUtils]: 115: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,673 INFO L290 TraceCheckUtils]: 116: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(5 == ~blastFlag~0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,674 INFO L290 TraceCheckUtils]: 117: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,675 INFO L290 TraceCheckUtils]: 118: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,675 INFO L290 TraceCheckUtils]: 119: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,675 INFO L290 TraceCheckUtils]: 120: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,675 INFO L290 TraceCheckUtils]: 121: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,676 INFO L290 TraceCheckUtils]: 122: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,676 INFO L290 TraceCheckUtils]: 123: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,676 INFO L290 TraceCheckUtils]: 124: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,676 INFO L290 TraceCheckUtils]: 125: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,677 INFO L290 TraceCheckUtils]: 126: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,677 INFO L290 TraceCheckUtils]: 127: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,677 INFO L290 TraceCheckUtils]: 128: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,677 INFO L290 TraceCheckUtils]: 129: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,678 INFO L290 TraceCheckUtils]: 130: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,678 INFO L290 TraceCheckUtils]: 131: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4385 == #t~mem57;havoc #t~mem57; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,678 INFO L290 TraceCheckUtils]: 132: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,678 INFO L290 TraceCheckUtils]: 133: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,679 INFO L290 TraceCheckUtils]: 134: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:44:00,679 INFO L290 TraceCheckUtils]: 135: Hoare triple {110829#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110830#(= |ssl3_connect_#t~mem93| 0)} is VALID [2022-04-08 08:44:00,679 INFO L290 TraceCheckUtils]: 136: Hoare triple {110830#(= |ssl3_connect_#t~mem93| 0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,679 INFO L290 TraceCheckUtils]: 137: Hoare triple {110824#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,679 INFO L290 TraceCheckUtils]: 138: Hoare triple {110824#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); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 139: Hoare triple {110824#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 140: Hoare triple {110824#false} ~skip~0 := 0; {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 141: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 142: Hoare triple {110824#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); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 143: Hoare triple {110824#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 144: Hoare triple {110824#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 145: Hoare triple {110824#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 146: Hoare triple {110824#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 147: Hoare triple {110824#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 148: Hoare triple {110824#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 149: Hoare triple {110824#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 150: Hoare triple {110824#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 151: Hoare triple {110824#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 152: Hoare triple {110824#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,680 INFO L290 TraceCheckUtils]: 153: Hoare triple {110824#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L290 TraceCheckUtils]: 154: Hoare triple {110824#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L290 TraceCheckUtils]: 155: Hoare triple {110824#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L290 TraceCheckUtils]: 156: Hoare triple {110824#false} assume 4432 == #t~mem62;havoc #t~mem62; {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L290 TraceCheckUtils]: 157: Hoare triple {110824#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L290 TraceCheckUtils]: 158: Hoare triple {110824#false} assume 5 == ~blastFlag~0; {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L290 TraceCheckUtils]: 159: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-08 08:44:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 206 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-08 08:44:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:00,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792225002] [2022-04-08 08:44:00,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792225002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:44:00,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823511242] [2022-04-08 08:44:00,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:44:00,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:44:00,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:44:00,695 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:00,705 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:47,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:44:47,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:44:47,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 1464 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 08:44:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:47,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:44:47,631 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:44:47,631 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:47,635 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:47,639 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:47,644 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:47,788 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 25 treesize of output 13 [2022-04-08 08:44:47,843 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:44:47,844 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:47,997 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-08 08:44:48,024 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:44:48,024 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-08 08:44:48,096 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:48,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {110823#true} call ULTIMATE.init(); {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {110823#true} call #t~ret158 := main(); {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {110823#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {110823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110823#true} is VALID [2022-04-08 08:44:48,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {110823#true} assume 12292 == #t~mem49;havoc #t~mem49; {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {110823#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {110823#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {110823#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {110823#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {110823#true} is VALID [2022-04-08 08:44:48,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {110823#true} assume !(0 == ~tmp___4~0); {110823#true} is VALID [2022-04-08 08:44:48,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {110823#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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {110898#(= 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; {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {110898#(= 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); {110898#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {110898#(= 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); {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {110823#true} assume 4368 == #t~mem54;havoc #t~mem54; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {110823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {110823#true} assume 4384 == #t~mem56;havoc #t~mem56; {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {110823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {110823#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {110823#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 67: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {110823#true} assume 4400 == #t~mem58;havoc #t~mem58; {110823#true} is VALID [2022-04-08 08:44:48,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {110823#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {110823#true} assume !(~ret~0 <= 0); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {110823#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 78: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 79: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 80: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 81: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 82: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 85: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 86: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 87: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 91: Hoare triple {110823#true} assume 4416 == #t~mem60;havoc #t~mem60; {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {110823#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {110823#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 95: Hoare triple {110823#true} assume !(0 == ~tmp___6~0); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 96: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 97: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,117 INFO L290 TraceCheckUtils]: 98: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 102: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 103: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 104: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 105: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 106: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 107: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 109: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 110: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 111: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {110823#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 113: Hoare triple {110823#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 114: Hoare triple {110823#true} assume 4432 == #t~mem62;havoc #t~mem62; {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 115: Hoare triple {110823#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 116: Hoare triple {110823#true} assume !(5 == ~blastFlag~0); {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 117: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 118: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 119: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 120: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 121: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 122: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,119 INFO L290 TraceCheckUtils]: 123: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 124: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 125: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 126: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 127: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 128: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 129: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 130: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 131: Hoare triple {110823#true} assume 4385 == #t~mem57;havoc #t~mem57; {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 132: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 133: Hoare triple {110823#true} assume !(1 == ~blastFlag~0); {110823#true} is VALID [2022-04-08 08:44:48,120 INFO L290 TraceCheckUtils]: 134: Hoare triple {110823#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {110823#true} is VALID [2022-04-08 08:44:48,121 INFO L290 TraceCheckUtils]: 135: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,128 INFO L290 TraceCheckUtils]: 136: Hoare triple {110823#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,129 INFO L290 TraceCheckUtils]: 137: Hoare triple {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,129 INFO L290 TraceCheckUtils]: 138: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,129 INFO L290 TraceCheckUtils]: 139: Hoare triple {111244#(<= 4560 (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; {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,130 INFO L290 TraceCheckUtils]: 140: Hoare triple {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,130 INFO L290 TraceCheckUtils]: 141: Hoare triple {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,130 INFO L290 TraceCheckUtils]: 142: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,130 INFO L290 TraceCheckUtils]: 143: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,130 INFO L290 TraceCheckUtils]: 144: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,131 INFO L290 TraceCheckUtils]: 145: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,131 INFO L290 TraceCheckUtils]: 146: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,131 INFO L290 TraceCheckUtils]: 147: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,131 INFO L290 TraceCheckUtils]: 148: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,131 INFO L290 TraceCheckUtils]: 149: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,131 INFO L290 TraceCheckUtils]: 150: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,132 INFO L290 TraceCheckUtils]: 151: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,132 INFO L290 TraceCheckUtils]: 152: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,132 INFO L290 TraceCheckUtils]: 153: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,132 INFO L290 TraceCheckUtils]: 154: Hoare triple {111244#(<= 4560 (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); {111244#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,132 INFO L290 TraceCheckUtils]: 155: Hoare triple {111244#(<= 4560 (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); {111302#(<= 4560 |ssl3_connect_#t~mem62|)} is VALID [2022-04-08 08:44:48,133 INFO L290 TraceCheckUtils]: 156: Hoare triple {111302#(<= 4560 |ssl3_connect_#t~mem62|)} assume 4432 == #t~mem62;havoc #t~mem62; {110824#false} is VALID [2022-04-08 08:44:48,133 INFO L290 TraceCheckUtils]: 157: Hoare triple {110824#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110824#false} is VALID [2022-04-08 08:44:48,133 INFO L290 TraceCheckUtils]: 158: Hoare triple {110824#false} assume 5 == ~blastFlag~0; {110824#false} is VALID [2022-04-08 08:44:48,133 INFO L290 TraceCheckUtils]: 159: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-08 08:44:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 60 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-08 08:44:48,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:44:48,410 INFO L290 TraceCheckUtils]: 159: Hoare triple {110824#false} assume !false; {110824#false} is VALID [2022-04-08 08:44:48,410 INFO L290 TraceCheckUtils]: 158: Hoare triple {110824#false} assume 5 == ~blastFlag~0; {110824#false} is VALID [2022-04-08 08:44:48,410 INFO L290 TraceCheckUtils]: 157: Hoare triple {110824#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110824#false} is VALID [2022-04-08 08:44:48,411 INFO L290 TraceCheckUtils]: 156: Hoare triple {111324#(not (<= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {110824#false} is VALID [2022-04-08 08:44:48,411 INFO L290 TraceCheckUtils]: 155: Hoare triple {111328#(< 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); {111324#(not (<= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-08 08:44:48,411 INFO L290 TraceCheckUtils]: 154: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,411 INFO L290 TraceCheckUtils]: 153: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,412 INFO L290 TraceCheckUtils]: 152: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,412 INFO L290 TraceCheckUtils]: 151: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,412 INFO L290 TraceCheckUtils]: 150: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,413 INFO L290 TraceCheckUtils]: 149: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,413 INFO L290 TraceCheckUtils]: 148: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,413 INFO L290 TraceCheckUtils]: 147: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,413 INFO L290 TraceCheckUtils]: 146: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,414 INFO L290 TraceCheckUtils]: 145: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,414 INFO L290 TraceCheckUtils]: 144: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,414 INFO L290 TraceCheckUtils]: 143: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,414 INFO L290 TraceCheckUtils]: 142: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,415 INFO L290 TraceCheckUtils]: 141: Hoare triple {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,415 INFO L290 TraceCheckUtils]: 140: Hoare triple {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,415 INFO L290 TraceCheckUtils]: 139: Hoare triple {111328#(< 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; {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,415 INFO L290 TraceCheckUtils]: 138: Hoare triple {111328#(< 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); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,416 INFO L290 TraceCheckUtils]: 137: Hoare triple {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 136: Hoare triple {110823#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {111328#(< 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 135: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 134: Hoare triple {110823#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 133: Hoare triple {110823#true} assume !(1 == ~blastFlag~0); {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 132: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 131: Hoare triple {110823#true} assume 4385 == #t~mem57;havoc #t~mem57; {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 130: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 129: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,417 INFO L290 TraceCheckUtils]: 128: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 127: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 126: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 125: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 124: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 123: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 122: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 121: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 120: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 119: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 118: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 117: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 116: Hoare triple {110823#true} assume !(5 == ~blastFlag~0); {110823#true} is VALID [2022-04-08 08:44:48,418 INFO L290 TraceCheckUtils]: 115: Hoare triple {110823#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 114: Hoare triple {110823#true} assume 4432 == #t~mem62;havoc #t~mem62; {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 113: Hoare triple {110823#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 112: Hoare triple {110823#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 111: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 110: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 109: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 108: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 107: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 106: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 105: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 104: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 103: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 102: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,419 INFO L290 TraceCheckUtils]: 101: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 100: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 99: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 97: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 96: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 95: Hoare triple {110823#true} assume !(0 == ~tmp___6~0); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {110823#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {110823#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 91: Hoare triple {110823#true} assume 4416 == #t~mem60;havoc #t~mem60; {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 90: Hoare triple {110823#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 89: Hoare triple {110823#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,420 INFO L290 TraceCheckUtils]: 87: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 86: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 85: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 84: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 83: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 80: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 79: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 78: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 77: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 76: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 75: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 74: Hoare triple {110823#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {110823#true} assume !(~ret~0 <= 0); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {110823#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {110823#true} assume 4400 == #t~mem58;havoc #t~mem58; {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {110823#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 67: Hoare triple {110823#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {110823#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {110823#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {110823#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {110823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {110823#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {110823#true} assume 4384 == #t~mem56;havoc #t~mem56; {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {110823#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {110823#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {110823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {110823#true} assume 4368 == #t~mem54;havoc #t~mem54; {110823#true} is VALID [2022-04-08 08:44:48,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {110823#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {110823#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {110823#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {110823#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {110823#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {110823#true} ~skip~0 := 0; {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {110823#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {110823#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {110823#true} assume !(0 == ~tmp___4~0); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {110823#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {110823#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {110823#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {110823#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {110823#true} assume 12292 == #t~mem49;havoc #t~mem49; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {110823#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {110823#true} assume !false; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {110823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {110823#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {110823#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; {110823#true} is VALID [2022-04-08 08:44:48,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {110823#true} call #t~ret158 := main(); {110823#true} is VALID [2022-04-08 08:44:48,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110823#true} {110823#true} #593#return; {110823#true} is VALID [2022-04-08 08:44:48,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {110823#true} assume true; {110823#true} is VALID [2022-04-08 08:44:48,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {110823#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); {110823#true} is VALID [2022-04-08 08:44:48,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {110823#true} call ULTIMATE.init(); {110823#true} is VALID [2022-04-08 08:44:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-08 08:44:48,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823511242] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:44:48,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:44:48,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-08 08:44:48,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:48,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24817193] [2022-04-08 08:44:48,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24817193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:48,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:48,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:44:48,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418674079] [2022-04-08 08:44:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:48,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-08 08:44:48,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:48,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:48,486 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:44:48,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:44:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:44:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:44:48,486 INFO L87 Difference]: Start difference. First operand 1015 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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,536 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:44:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:56,368 INFO L93 Difference]: Finished difference Result 2468 states and 3519 transitions. [2022-04-08 08:44:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:44:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 160 [2022-04-08 08:44:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-08 08:44:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-08 08:44:56,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 472 transitions. [2022-04-08 08:44:56,649 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:44:56,726 INFO L225 Difference]: With dead ends: 2468 [2022-04-08 08:44:56,726 INFO L226 Difference]: Without dead ends: 1469 [2022-04-08 08:44:56,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:44:56,727 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 99 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:56,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 545 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:44:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-04-08 08:44:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1011. [2022-04-08 08:44:57,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:57,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1469 states. Second operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call 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:57,190 INFO L74 IsIncluded]: Start isIncluded. First operand 1469 states. Second operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call 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:57,190 INFO L87 Difference]: Start difference. First operand 1469 states. Second operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call 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:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:57,240 INFO L93 Difference]: Finished difference Result 1469 states and 2086 transitions. [2022-04-08 08:44:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2086 transitions. [2022-04-08 08:44:57,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:57,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:57,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 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 1469 states. [2022-04-08 08:44:57,243 INFO L87 Difference]: Start difference. First operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 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 1469 states. [2022-04-08 08:44:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:57,294 INFO L93 Difference]: Finished difference Result 1469 states and 2086 transitions. [2022-04-08 08:44:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2086 transitions. [2022-04-08 08:44:57,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:57,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:57,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:57,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1006 states have (on average 1.4314115308151094) internal successors, (1440), 1006 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call 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:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1444 transitions. [2022-04-08 08:44:57,333 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1444 transitions. Word has length 160 [2022-04-08 08:44:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:57,333 INFO L478 AbstractCegarLoop]: Abstraction has 1011 states and 1444 transitions. [2022-04-08 08:44:57,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:57,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1011 states and 1444 transitions. [2022-04-08 08:44:58,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1444 edges. 1444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1444 transitions. [2022-04-08 08:44:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 08:44:58,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:58,838 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 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:44:58,876 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:59,038 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,SelfDestructingSolverStorable22 [2022-04-08 08:44:59,039 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 894528072, now seen corresponding path program 1 times [2022-04-08 08:44:59,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:59,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167719574] [2022-04-08 08:45:12,653 WARN L232 SmtUtils]: Spent 9.22s 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,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 894528072, now seen corresponding path program 2 times [2022-04-08 08:45:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548213244] [2022-04-08 08:45:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:19,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {121701#(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); {121694#true} is VALID [2022-04-08 08:45:19,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {121694#true} assume true; {121694#true} is VALID [2022-04-08 08:45:19,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121694#true} {121694#true} #593#return; {121694#true} is VALID [2022-04-08 08:45:19,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {121694#true} call ULTIMATE.init(); {121701#(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,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {121701#(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); {121694#true} is VALID [2022-04-08 08:45:19,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {121694#true} assume true; {121694#true} is VALID [2022-04-08 08:45:19,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121694#true} {121694#true} #593#return; {121694#true} is VALID [2022-04-08 08:45:19,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {121694#true} call #t~ret158 := main(); {121694#true} is VALID [2022-04-08 08:45:19,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {121694#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {121694#true} is VALID [2022-04-08 08:45:19,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {121694#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {121694#true} assume 12292 == #t~mem49;havoc #t~mem49; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {121694#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {121694#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {121694#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {121694#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {121694#true} assume !(0 == ~tmp___4~0); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {121694#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {121694#true} assume 4368 == #t~mem54;havoc #t~mem54; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {121694#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {121694#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 41: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {121694#true} assume 4384 == #t~mem56;havoc #t~mem56; {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {121694#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {121694#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {121694#true} is VALID [2022-04-08 08:45:19,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {121694#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {121694#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {121694#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {121694#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,648 INFO L290 TraceCheckUtils]: 66: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 68: Hoare triple {121694#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 69: Hoare triple {121694#true} assume 4400 == #t~mem58;havoc #t~mem58; {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {121694#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; {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {121694#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {121694#true} assume !(~ret~0 <= 0); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {121694#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 75: Hoare triple {121694#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 76: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 77: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 78: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 81: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 85: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 86: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 87: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 88: Hoare triple {121694#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 89: Hoare triple {121694#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 90: Hoare triple {121694#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 91: Hoare triple {121694#true} assume 4416 == #t~mem60;havoc #t~mem60; {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 92: Hoare triple {121694#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 93: Hoare triple {121694#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 94: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,650 INFO L290 TraceCheckUtils]: 95: Hoare triple {121694#true} assume !(0 == ~tmp___6~0); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {121694#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 97: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 98: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 99: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 100: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 101: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 102: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 103: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 104: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 105: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 106: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 107: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 108: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,651 INFO L290 TraceCheckUtils]: 109: Hoare triple {121694#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 110: Hoare triple {121694#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 111: Hoare triple {121694#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 112: Hoare triple {121694#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 113: Hoare triple {121694#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 114: Hoare triple {121694#true} assume 4432 == #t~mem62;havoc #t~mem62; {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 115: Hoare triple {121694#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 116: Hoare triple {121694#true} assume !(5 == ~blastFlag~0); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 117: Hoare triple {121694#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); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 118: Hoare triple {121694#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 119: Hoare triple {121694#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 120: Hoare triple {121694#true} ~skip~0 := 0; {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 121: Hoare triple {121694#true} assume !false; {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 122: Hoare triple {121694#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,652 INFO L290 TraceCheckUtils]: 123: Hoare triple {121694#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 124: Hoare triple {121694#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 125: Hoare triple {121694#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 126: Hoare triple {121694#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 127: Hoare triple {121694#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 128: Hoare triple {121694#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 129: Hoare triple {121694#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 130: Hoare triple {121694#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 131: Hoare triple {121694#true} assume 4385 == #t~mem57;havoc #t~mem57; {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 132: Hoare triple {121694#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 133: Hoare triple {121694#true} assume !(1 == ~blastFlag~0); {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 134: Hoare triple {121694#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {121694#true} is VALID [2022-04-08 08:45:19,653 INFO L290 TraceCheckUtils]: 135: Hoare triple {121694#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {121694#true} is VALID [2022-04-08 08:45:19,654 INFO L290 TraceCheckUtils]: 136: Hoare triple {121694#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,655 INFO L290 TraceCheckUtils]: 137: Hoare triple {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,655 INFO L290 TraceCheckUtils]: 138: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,655 INFO L290 TraceCheckUtils]: 139: Hoare triple {121699#(= 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; {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,656 INFO L290 TraceCheckUtils]: 140: Hoare triple {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,656 INFO L290 TraceCheckUtils]: 141: Hoare triple {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,656 INFO L290 TraceCheckUtils]: 142: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,656 INFO L290 TraceCheckUtils]: 143: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,657 INFO L290 TraceCheckUtils]: 144: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,657 INFO L290 TraceCheckUtils]: 145: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,657 INFO L290 TraceCheckUtils]: 146: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,658 INFO L290 TraceCheckUtils]: 147: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,658 INFO L290 TraceCheckUtils]: 148: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,658 INFO L290 TraceCheckUtils]: 149: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,658 INFO L290 TraceCheckUtils]: 150: Hoare triple {121699#(= 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); {121699#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 151: Hoare triple {121699#(= 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); {121700#(= |ssl3_connect_#t~mem58| 4400)} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 152: Hoare triple {121700#(= |ssl3_connect_#t~mem58| 4400)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 153: Hoare triple {121695#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 154: Hoare triple {121695#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 155: Hoare triple {121695#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 156: Hoare triple {121695#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121695#false} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 157: Hoare triple {121695#false} assume 4433 == #t~mem63;havoc #t~mem63; {121695#false} is VALID [2022-04-08 08:45:19,659 INFO L290 TraceCheckUtils]: 158: Hoare triple {121695#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {121695#false} is VALID [2022-04-08 08:45:19,660 INFO L290 TraceCheckUtils]: 159: Hoare triple {121695#false} assume 5 == ~blastFlag~0; {121695#false} is VALID [2022-04-08 08:45:19,660 INFO L290 TraceCheckUtils]: 160: Hoare triple {121695#false} assume !false; {121695#false} is VALID [2022-04-08 08:45:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-08 08:45:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:19,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548213244] [2022-04-08 08:45:19,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548213244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:19,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:19,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:19,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:19,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167719574] [2022-04-08 08:45:19,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167719574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:19,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:19,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556065810] [2022-04-08 08:45:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 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 161 [2022-04-08 08:45:19,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:19,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:19,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:19,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:19,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:19,741 INFO L87 Difference]: Start difference. First operand 1011 states and 1444 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,774 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:45:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:23,588 INFO L93 Difference]: Finished difference Result 2177 states and 3095 transitions. [2022-04-08 08:45:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:23,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 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 161 [2022-04-08 08:45:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-08 08:45:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-04-08 08:45:23,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 393 transitions. [2022-04-08 08:45:23,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:23,895 INFO L225 Difference]: With dead ends: 2177 [2022-04-08 08:45:23,895 INFO L226 Difference]: Without dead ends: 1182 [2022-04-08 08:45:23,896 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:45:23,897 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 34 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:23,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 492 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:45:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-04-08 08:45:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1095. [2022-04-08 08:45:24,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:24,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1182 states. Second operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,433 INFO L74 IsIncluded]: Start isIncluded. First operand 1182 states. Second operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,434 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:24,468 INFO L93 Difference]: Finished difference Result 1182 states and 1667 transitions. [2022-04-08 08:45:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1667 transitions. [2022-04-08 08:45:24,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:24,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:24,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 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 1182 states. [2022-04-08 08:45:24,471 INFO L87 Difference]: Start difference. First operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 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 1182 states. [2022-04-08 08:45:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:24,505 INFO L93 Difference]: Finished difference Result 1182 states and 1667 transitions. [2022-04-08 08:45:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1667 transitions. [2022-04-08 08:45:24,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:24,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:24,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:24,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1090 states have (on average 1.4275229357798165) internal successors, (1556), 1090 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1560 transitions. [2022-04-08 08:45:24,548 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1560 transitions. Word has length 161 [2022-04-08 08:45:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:24,548 INFO L478 AbstractCegarLoop]: Abstraction has 1095 states and 1560 transitions. [2022-04-08 08:45:24,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1095 states and 1560 transitions. [2022-04-08 08:45:26,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1560 edges. 1560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1560 transitions. [2022-04-08 08:45:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 08:45:26,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:26,139 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 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, 1] [2022-04-08 08:45:26,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:45:26,139 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:26,139 INFO L85 PathProgramCache]: Analyzing trace with hash 753979462, now seen corresponding path program 1 times [2022-04-08 08:45:26,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:26,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203810117] [2022-04-08 08:45:39,856 WARN L232 SmtUtils]: Spent 9.37s 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:47,649 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash 753979462, now seen corresponding path program 2 times [2022-04-08 08:45:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:47,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313132422] [2022-04-08 08:45:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:47,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {130622#(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); {130614#true} is VALID [2022-04-08 08:45:47,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-08 08:45:47,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-08 08:45:47,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {130614#true} call ULTIMATE.init(); {130622#(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:47,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {130622#(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); {130614#true} is VALID [2022-04-08 08:45:47,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-08 08:45:47,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-08 08:45:47,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {130614#true} call #t~ret158 := main(); {130614#true} is VALID [2022-04-08 08:45:47,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {130614#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {130614#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {130614#true} assume 12292 == #t~mem49;havoc #t~mem49; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {130614#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {130614#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {130614#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:45:47,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {130614#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {130614#true} assume !(0 == ~tmp___4~0); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {130614#true} assume 4368 == #t~mem54;havoc #t~mem54; {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:45:47,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {130614#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:45:47,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {130614#true} assume 4384 == #t~mem56;havoc #t~mem56; {130614#true} is VALID [2022-04-08 08:45:47,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-08 08:45:47,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {130614#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130614#true} is VALID [2022-04-08 08:45:47,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130619#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:45:47,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {130619#(= |ssl3_connect_#t~mem93| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,865 INFO L290 TraceCheckUtils]: 63: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,865 INFO L290 TraceCheckUtils]: 64: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,865 INFO L290 TraceCheckUtils]: 65: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem58;havoc #t~mem58; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,868 INFO L290 TraceCheckUtils]: 74: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,868 INFO L290 TraceCheckUtils]: 75: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,868 INFO L290 TraceCheckUtils]: 76: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,869 INFO L290 TraceCheckUtils]: 78: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,869 INFO L290 TraceCheckUtils]: 79: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,869 INFO L290 TraceCheckUtils]: 80: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,871 INFO L290 TraceCheckUtils]: 88: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem60;havoc #t~mem60; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,874 INFO L290 TraceCheckUtils]: 95: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,875 INFO L290 TraceCheckUtils]: 99: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,875 INFO L290 TraceCheckUtils]: 100: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,875 INFO L290 TraceCheckUtils]: 101: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,876 INFO L290 TraceCheckUtils]: 103: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,876 INFO L290 TraceCheckUtils]: 104: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,876 INFO L290 TraceCheckUtils]: 105: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,876 INFO L290 TraceCheckUtils]: 106: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,877 INFO L290 TraceCheckUtils]: 107: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,877 INFO L290 TraceCheckUtils]: 108: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,877 INFO L290 TraceCheckUtils]: 109: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,878 INFO L290 TraceCheckUtils]: 110: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,878 INFO L290 TraceCheckUtils]: 111: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,878 INFO L290 TraceCheckUtils]: 112: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,878 INFO L290 TraceCheckUtils]: 113: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,879 INFO L290 TraceCheckUtils]: 114: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4432 == #t~mem62;havoc #t~mem62; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,879 INFO L290 TraceCheckUtils]: 115: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,879 INFO L290 TraceCheckUtils]: 116: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(5 == ~blastFlag~0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,880 INFO L290 TraceCheckUtils]: 117: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,880 INFO L290 TraceCheckUtils]: 118: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,880 INFO L290 TraceCheckUtils]: 119: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,881 INFO L290 TraceCheckUtils]: 120: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,881 INFO L290 TraceCheckUtils]: 121: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,881 INFO L290 TraceCheckUtils]: 122: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,881 INFO L290 TraceCheckUtils]: 123: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,882 INFO L290 TraceCheckUtils]: 124: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,882 INFO L290 TraceCheckUtils]: 125: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,882 INFO L290 TraceCheckUtils]: 126: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,882 INFO L290 TraceCheckUtils]: 127: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,883 INFO L290 TraceCheckUtils]: 128: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,883 INFO L290 TraceCheckUtils]: 129: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,883 INFO L290 TraceCheckUtils]: 130: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,883 INFO L290 TraceCheckUtils]: 131: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4385 == #t~mem57;havoc #t~mem57; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,884 INFO L290 TraceCheckUtils]: 132: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,884 INFO L290 TraceCheckUtils]: 133: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,884 INFO L290 TraceCheckUtils]: 134: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:45:47,884 INFO L290 TraceCheckUtils]: 135: Hoare triple {130620#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130621#(= |ssl3_connect_#t~mem93| 0)} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 136: Hoare triple {130621#(= |ssl3_connect_#t~mem93| 0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 137: Hoare triple {130615#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 138: Hoare triple {130615#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); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 139: Hoare triple {130615#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 140: Hoare triple {130615#false} ~skip~0 := 0; {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 141: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 142: Hoare triple {130615#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); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 143: Hoare triple {130615#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 144: Hoare triple {130615#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 145: Hoare triple {130615#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 146: Hoare triple {130615#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 147: Hoare triple {130615#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,885 INFO L290 TraceCheckUtils]: 148: Hoare triple {130615#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 149: Hoare triple {130615#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 150: Hoare triple {130615#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 151: Hoare triple {130615#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {130615#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 153: Hoare triple {130615#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 154: Hoare triple {130615#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 155: Hoare triple {130615#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 156: Hoare triple {130615#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 157: Hoare triple {130615#false} assume 4433 == #t~mem63;havoc #t~mem63; {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 158: Hoare triple {130615#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 159: Hoare triple {130615#false} assume 5 == ~blastFlag~0; {130615#false} is VALID [2022-04-08 08:45:47,886 INFO L290 TraceCheckUtils]: 160: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-08 08:45:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 206 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-08 08:45:47,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:47,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313132422] [2022-04-08 08:45:47,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313132422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:45:47,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880496934] [2022-04-08 08:45:47,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:45:47,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:45:47,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:45:47,888 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:47,889 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:47:11,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:47:11,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:47:11,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 08:47:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:11,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:47:11,354 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:47:11,354 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:11,356 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:11,360 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:11,365 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:11,488 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-08 08:47:11,497 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:11,534 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:47:11,534 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:11,681 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-08 08:47:11,707 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:47:11,707 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-08 08:47:11,792 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:11,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {130614#true} call ULTIMATE.init(); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {130614#true} call #t~ret158 := main(); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {130614#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {130614#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {130614#true} assume 12292 == #t~mem49;havoc #t~mem49; {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {130614#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {130614#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {130614#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {130614#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {130614#true} is VALID [2022-04-08 08:47:11,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {130614#true} assume !(0 == ~tmp___4~0); {130614#true} is VALID [2022-04-08 08:47:11,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {130614#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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {130689#(= 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; {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {130689#(= 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); {130689#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {130689#(= 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); {130614#true} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {130614#true} assume 4368 == #t~mem54;havoc #t~mem54; {130614#true} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {130614#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130614#true} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {130614#true} assume 4384 == #t~mem56;havoc #t~mem56; {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-08 08:47:11,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {130614#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {130614#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {130614#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {130614#true} assume 4400 == #t~mem58;havoc #t~mem58; {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {130614#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {130614#true} assume !(~ret~0 <= 0); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {130614#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 75: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 76: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 77: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 78: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 79: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 82: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 83: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 84: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 85: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 86: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 87: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 88: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 90: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {130614#true} assume 4416 == #t~mem60;havoc #t~mem60; {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 92: Hoare triple {130614#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {130614#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130614#true} is VALID [2022-04-08 08:47:11,820 INFO L290 TraceCheckUtils]: 94: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 95: Hoare triple {130614#true} assume !(0 == ~tmp___6~0); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 96: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 97: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 98: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 99: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 100: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 101: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 102: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 103: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 104: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 105: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 106: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 107: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 108: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,821 INFO L290 TraceCheckUtils]: 109: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 110: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 111: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 112: Hoare triple {130614#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 113: Hoare triple {130614#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 114: Hoare triple {130614#true} assume 4432 == #t~mem62;havoc #t~mem62; {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 115: Hoare triple {130614#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 116: Hoare triple {130614#true} assume !(5 == ~blastFlag~0); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 117: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 118: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 119: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 120: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 121: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 122: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,822 INFO L290 TraceCheckUtils]: 123: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 124: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 125: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 126: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 127: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 128: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 129: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 130: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 131: Hoare triple {130614#true} assume 4385 == #t~mem57;havoc #t~mem57; {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 132: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 133: Hoare triple {130614#true} assume !(1 == ~blastFlag~0); {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 134: Hoare triple {130614#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {130614#true} is VALID [2022-04-08 08:47:11,823 INFO L290 TraceCheckUtils]: 135: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:11,824 INFO L290 TraceCheckUtils]: 136: Hoare triple {130614#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,825 INFO L290 TraceCheckUtils]: 137: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,825 INFO L290 TraceCheckUtils]: 138: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,825 INFO L290 TraceCheckUtils]: 139: Hoare triple {131035#(<= 4560 (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; {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,825 INFO L290 TraceCheckUtils]: 140: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,826 INFO L290 TraceCheckUtils]: 141: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,826 INFO L290 TraceCheckUtils]: 142: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,826 INFO L290 TraceCheckUtils]: 143: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,826 INFO L290 TraceCheckUtils]: 144: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,827 INFO L290 TraceCheckUtils]: 145: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,827 INFO L290 TraceCheckUtils]: 146: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,827 INFO L290 TraceCheckUtils]: 147: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,828 INFO L290 TraceCheckUtils]: 148: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,828 INFO L290 TraceCheckUtils]: 149: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,828 INFO L290 TraceCheckUtils]: 150: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,828 INFO L290 TraceCheckUtils]: 151: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,829 INFO L290 TraceCheckUtils]: 152: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,829 INFO L290 TraceCheckUtils]: 153: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,829 INFO L290 TraceCheckUtils]: 154: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,830 INFO L290 TraceCheckUtils]: 155: Hoare triple {131035#(<= 4560 (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); {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:11,830 INFO L290 TraceCheckUtils]: 156: Hoare triple {131035#(<= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131096#(<= 4560 |ssl3_connect_#t~mem63|)} is VALID [2022-04-08 08:47:11,830 INFO L290 TraceCheckUtils]: 157: Hoare triple {131096#(<= 4560 |ssl3_connect_#t~mem63|)} assume 4433 == #t~mem63;havoc #t~mem63; {130615#false} is VALID [2022-04-08 08:47:11,830 INFO L290 TraceCheckUtils]: 158: Hoare triple {130615#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130615#false} is VALID [2022-04-08 08:47:11,830 INFO L290 TraceCheckUtils]: 159: Hoare triple {130615#false} assume 5 == ~blastFlag~0; {130615#false} is VALID [2022-04-08 08:47:11,830 INFO L290 TraceCheckUtils]: 160: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-08 08:47:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 60 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-08 08:47:11,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:47:12,109 INFO L290 TraceCheckUtils]: 160: Hoare triple {130615#false} assume !false; {130615#false} is VALID [2022-04-08 08:47:12,109 INFO L290 TraceCheckUtils]: 159: Hoare triple {130615#false} assume 5 == ~blastFlag~0; {130615#false} is VALID [2022-04-08 08:47:12,110 INFO L290 TraceCheckUtils]: 158: Hoare triple {130615#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130615#false} is VALID [2022-04-08 08:47:12,110 INFO L290 TraceCheckUtils]: 157: Hoare triple {131118#(not (<= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {130615#false} is VALID [2022-04-08 08:47:12,110 INFO L290 TraceCheckUtils]: 156: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131118#(not (<= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-08 08:47:12,111 INFO L290 TraceCheckUtils]: 155: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,111 INFO L290 TraceCheckUtils]: 154: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,111 INFO L290 TraceCheckUtils]: 153: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,111 INFO L290 TraceCheckUtils]: 152: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,112 INFO L290 TraceCheckUtils]: 151: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,112 INFO L290 TraceCheckUtils]: 150: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,112 INFO L290 TraceCheckUtils]: 149: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,113 INFO L290 TraceCheckUtils]: 148: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,113 INFO L290 TraceCheckUtils]: 147: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,113 INFO L290 TraceCheckUtils]: 146: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,113 INFO L290 TraceCheckUtils]: 145: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,114 INFO L290 TraceCheckUtils]: 144: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,114 INFO L290 TraceCheckUtils]: 143: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,114 INFO L290 TraceCheckUtils]: 142: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,115 INFO L290 TraceCheckUtils]: 141: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,115 INFO L290 TraceCheckUtils]: 140: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,115 INFO L290 TraceCheckUtils]: 139: Hoare triple {131122#(< 4433 (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; {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,115 INFO L290 TraceCheckUtils]: 138: Hoare triple {131122#(< 4433 (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); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,116 INFO L290 TraceCheckUtils]: 137: Hoare triple {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 136: Hoare triple {130614#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {131122#(< 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 135: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 134: Hoare triple {130614#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 133: Hoare triple {130614#true} assume !(1 == ~blastFlag~0); {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 132: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 131: Hoare triple {130614#true} assume 4385 == #t~mem57;havoc #t~mem57; {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 130: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 129: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 128: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,117 INFO L290 TraceCheckUtils]: 127: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 126: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 125: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 124: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 123: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 122: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 121: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 120: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 119: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 118: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 117: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 116: Hoare triple {130614#true} assume !(5 == ~blastFlag~0); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 115: Hoare triple {130614#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {130614#true} assume 4432 == #t~mem62;havoc #t~mem62; {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 113: Hoare triple {130614#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {130614#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 111: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 110: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 109: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 108: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 107: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 105: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 104: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 103: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 102: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 101: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 100: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 99: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 97: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 96: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 95: Hoare triple {130614#true} assume !(0 == ~tmp___6~0); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 94: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 93: Hoare triple {130614#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 92: Hoare triple {130614#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 91: Hoare triple {130614#true} assume 4416 == #t~mem60;havoc #t~mem60; {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 90: Hoare triple {130614#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 89: Hoare triple {130614#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 87: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 83: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 81: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 80: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 79: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {130614#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 73: Hoare triple {130614#true} assume !(~ret~0 <= 0); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 72: Hoare triple {130614#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 71: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,121 INFO L290 TraceCheckUtils]: 69: Hoare triple {130614#true} assume 4400 == #t~mem58;havoc #t~mem58; {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 68: Hoare triple {130614#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {130614#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 66: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 65: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 64: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 63: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 62: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 61: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 59: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 55: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {130614#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {130614#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {130614#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {130614#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {130614#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {130614#true} assume 4384 == #t~mem56;havoc #t~mem56; {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {130614#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {130614#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {130614#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {130614#true} assume 4368 == #t~mem54;havoc #t~mem54; {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {130614#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {130614#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {130614#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {130614#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {130614#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {130614#true} ~skip~0 := 0; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {130614#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {130614#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {130614#true} assume !(0 == ~tmp___4~0); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {130614#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {130614#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {130614#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {130614#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {130614#true} assume 12292 == #t~mem49;havoc #t~mem49; {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {130614#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130614#true} is VALID [2022-04-08 08:47:12,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {130614#true} assume !false; {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {130614#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {130614#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {130614#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; {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {130614#true} call #t~ret158 := main(); {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130614#true} {130614#true} #593#return; {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {130614#true} assume true; {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {130614#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); {130614#true} is VALID [2022-04-08 08:47:12,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {130614#true} call ULTIMATE.init(); {130614#true} is VALID [2022-04-08 08:47:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-08 08:47:12,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880496934] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:47:12,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:47:12,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-04-08 08:47:12,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:12,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203810117] [2022-04-08 08:47:12,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203810117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:12,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:12,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:47:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512312580] [2022-04-08 08:47:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:12,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 161 [2022-04-08 08:47:12,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:12,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:12,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:12,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:47:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:47:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:47:12,190 INFO L87 Difference]: Start difference. First operand 1095 states and 1560 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:16,228 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:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:20,136 INFO L93 Difference]: Finished difference Result 2611 states and 3721 transitions. [2022-04-08 08:47:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:47:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 161 [2022-04-08 08:47:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-04-08 08:47:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-04-08 08:47:20,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 466 transitions. [2022-04-08 08:47:20,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:20,546 INFO L225 Difference]: With dead ends: 2611 [2022-04-08 08:47:20,546 INFO L226 Difference]: Without dead ends: 1532 [2022-04-08 08:47:20,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:47:20,548 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 93 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:20,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 535 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 231 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:47:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-04-08 08:47:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1225. [2022-04-08 08:47:21,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:21,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1532 states. Second operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call 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:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand 1532 states. Second operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call 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:21,143 INFO L87 Difference]: Start difference. First operand 1532 states. Second operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call 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:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:21,196 INFO L93 Difference]: Finished difference Result 1532 states and 2176 transitions. [2022-04-08 08:47:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2176 transitions. [2022-04-08 08:47:21,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:21,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:21,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 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 1532 states. [2022-04-08 08:47:21,200 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 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 1532 states. [2022-04-08 08:47:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:21,254 INFO L93 Difference]: Finished difference Result 1532 states and 2176 transitions. [2022-04-08 08:47:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2176 transitions. [2022-04-08 08:47:21,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:21,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:21,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:21,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.4270491803278689) internal successors, (1741), 1220 states have internal predecessors, (1741), 3 states have call successors, (3), 3 states have call 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:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1745 transitions. [2022-04-08 08:47:21,308 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1745 transitions. Word has length 161 [2022-04-08 08:47:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:21,308 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1745 transitions. [2022-04-08 08:47:21,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1745 transitions. [2022-04-08 08:47:22,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1745 edges. 1745 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1745 transitions. [2022-04-08 08:47:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 08:47:22,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:22,736 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:22,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 08:47:22,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:47:22,963 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash 911024446, now seen corresponding path program 1 times [2022-04-08 08:47:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:22,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390479672] [2022-04-08 08:47:45,415 WARN L232 SmtUtils]: Spent 16.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:47:52,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 911024446, now seen corresponding path program 2 times [2022-04-08 08:47:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:52,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638202029] [2022-04-08 08:47:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:53,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {142340#(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); {142331#true} is VALID [2022-04-08 08:47:53,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-08 08:47:53,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {142331#true} call ULTIMATE.init(); {142340#(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:47:53,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {142340#(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); {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {142331#true} call #t~ret158 := main(); {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {142331#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {142331#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {142331#true} assume 12292 == #t~mem49;havoc #t~mem49; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {142331#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {142331#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {142331#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {142331#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {142331#true} assume !(0 == ~tmp___4~0); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:47:53,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {142331#true} assume 4368 == #t~mem54;havoc #t~mem54; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {142331#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:47:53,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {142331#true} assume 4384 == #t~mem56;havoc #t~mem56; {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {142331#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {142331#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142336#(= |ssl3_connect_#t~mem53| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:47:53,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {142336#(= |ssl3_connect_#t~mem53| (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {142337#(not (= 4099 (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); {142338#(not (= |ssl3_connect_#t~mem58| 4099))} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {142338#(not (= |ssl3_connect_#t~mem58| 4099))} assume 4400 == #t~mem58;havoc #t~mem58; {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 70: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {142331#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {142331#true} assume !(~ret~0 <= 0); {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {142331#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:47:53,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 78: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 79: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 81: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 82: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 83: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 86: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 90: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 91: Hoare triple {142331#true} assume 4416 == #t~mem60;havoc #t~mem60; {142331#true} is VALID [2022-04-08 08:47:53,235 INFO L290 TraceCheckUtils]: 92: Hoare triple {142331#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 93: Hoare triple {142331#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 94: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 95: Hoare triple {142331#true} assume !(0 == ~tmp___6~0); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 98: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 99: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 100: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 101: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 102: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 103: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 104: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 105: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 106: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,236 INFO L290 TraceCheckUtils]: 107: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 108: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 109: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 110: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 111: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 114: Hoare triple {142331#true} assume 4432 == #t~mem62;havoc #t~mem62; {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 115: Hoare triple {142331#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 116: Hoare triple {142331#true} assume !(5 == ~blastFlag~0); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 117: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 118: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 119: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 120: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 121: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:47:53,237 INFO L290 TraceCheckUtils]: 122: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 123: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 124: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 125: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 127: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 128: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 129: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 130: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 131: Hoare triple {142331#true} assume 4385 == #t~mem57;havoc #t~mem57; {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 132: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 133: Hoare triple {142331#true} assume !(1 == ~blastFlag~0); {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 134: Hoare triple {142331#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {142331#true} is VALID [2022-04-08 08:47:53,238 INFO L290 TraceCheckUtils]: 135: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:47:53,239 INFO L290 TraceCheckUtils]: 136: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,239 INFO L290 TraceCheckUtils]: 137: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,240 INFO L290 TraceCheckUtils]: 138: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,240 INFO L290 TraceCheckUtils]: 139: Hoare triple {142337#(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; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,240 INFO L290 TraceCheckUtils]: 140: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,240 INFO L290 TraceCheckUtils]: 141: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,241 INFO L290 TraceCheckUtils]: 142: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,241 INFO L290 TraceCheckUtils]: 143: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,241 INFO L290 TraceCheckUtils]: 144: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,241 INFO L290 TraceCheckUtils]: 145: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 146: Hoare triple {142337#(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); {142339#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 147: Hoare triple {142339#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 148: Hoare triple {142332#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 149: Hoare triple {142332#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 150: Hoare triple {142332#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 151: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 152: Hoare triple {142332#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 153: Hoare triple {142332#false} assume !(0 == ~tmp___4~0); {142332#false} is VALID [2022-04-08 08:47:53,242 INFO L290 TraceCheckUtils]: 154: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 155: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 156: Hoare triple {142332#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 157: Hoare triple {142332#false} ~skip~0 := 0; {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 158: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 159: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 160: Hoare triple {142332#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 161: Hoare triple {142332#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 162: Hoare triple {142332#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 163: Hoare triple {142332#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 164: Hoare triple {142332#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 165: Hoare triple {142332#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 166: Hoare triple {142332#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 167: Hoare triple {142332#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 168: Hoare triple {142332#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,243 INFO L290 TraceCheckUtils]: 169: Hoare triple {142332#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 170: Hoare triple {142332#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 171: Hoare triple {142332#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 172: Hoare triple {142332#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 173: Hoare triple {142332#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 174: Hoare triple {142332#false} assume 4433 == #t~mem63;havoc #t~mem63; {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 175: Hoare triple {142332#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 176: Hoare triple {142332#false} assume 5 == ~blastFlag~0; {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L290 TraceCheckUtils]: 177: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-08 08:47:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 180 proven. 18 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-04-08 08:47:53,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:53,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638202029] [2022-04-08 08:47:53,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638202029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:47:53,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048765487] [2022-04-08 08:47:53,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:47:53,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:47:53,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:47:53,246 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:47:53,246 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:48:43,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:48:43,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:48:43,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 08:48:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:43,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:48:43,935 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:48:43,935 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:48:43,938 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:48:43,941 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:48:43,946 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:48:44,085 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:48:44,086 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:48:44,233 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-08 08:48:44,240 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:48:44,242 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:48:44,278 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:48:44,278 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:48:44,346 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:48:44,455 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-08 08:48:44,479 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:48:44,479 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-08 08:48:44,523 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:48:44,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {142331#true} call ULTIMATE.init(); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {142331#true} call #t~ret158 := main(); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {142331#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {142331#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {142331#true} assume 12292 == #t~mem49;havoc #t~mem49; {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {142331#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {142331#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {142331#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {142331#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142331#true} is VALID [2022-04-08 08:48:44,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {142331#true} assume !(0 == ~tmp___4~0); {142331#true} is VALID [2022-04-08 08:48:44,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {142331#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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {142407#(= 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; {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {142407#(= 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); {142407#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {142407#(= 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); {142331#true} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {142331#true} assume 4368 == #t~mem54;havoc #t~mem54; {142331#true} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {142331#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142331#true} is VALID [2022-04-08 08:48:44,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {142331#true} assume 4384 == #t~mem56;havoc #t~mem56; {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {142331#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {142331#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 60: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142336#(= |ssl3_connect_#t~mem53| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {142336#(= |ssl3_connect_#t~mem53| (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {142337#(not (= 4099 (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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {142337#(not (= 4099 (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); {142338#(not (= |ssl3_connect_#t~mem58| 4099))} is VALID [2022-04-08 08:48:44,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {142338#(not (= |ssl3_connect_#t~mem58| 4099))} assume 4400 == #t~mem58;havoc #t~mem58; {142331#true} is VALID [2022-04-08 08:48:44,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {142331#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {142331#true} assume !(~ret~0 <= 0); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {142331#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 77: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 80: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 81: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 82: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 83: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 84: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,583 INFO L290 TraceCheckUtils]: 85: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 88: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 89: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 90: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 91: Hoare triple {142331#true} assume 4416 == #t~mem60;havoc #t~mem60; {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {142331#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {142331#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 95: Hoare triple {142331#true} assume !(0 == ~tmp___6~0); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 97: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 98: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 99: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,584 INFO L290 TraceCheckUtils]: 100: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 101: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 102: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 103: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 104: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 105: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 106: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 107: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 108: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 109: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 110: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 111: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,585 INFO L290 TraceCheckUtils]: 114: Hoare triple {142331#true} assume 4432 == #t~mem62;havoc #t~mem62; {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 115: Hoare triple {142331#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 116: Hoare triple {142331#true} assume !(5 == ~blastFlag~0); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 117: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 118: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 119: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 120: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 121: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 122: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 123: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 124: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 125: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 126: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 127: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 128: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,586 INFO L290 TraceCheckUtils]: 129: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 130: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 131: Hoare triple {142331#true} assume 4385 == #t~mem57;havoc #t~mem57; {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 132: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 133: Hoare triple {142331#true} assume !(1 == ~blastFlag~0); {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 134: Hoare triple {142331#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 135: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,587 INFO L290 TraceCheckUtils]: 136: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,588 INFO L290 TraceCheckUtils]: 137: Hoare triple {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,588 INFO L290 TraceCheckUtils]: 138: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,589 INFO L290 TraceCheckUtils]: 139: Hoare triple {142753#(= 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; {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,589 INFO L290 TraceCheckUtils]: 140: Hoare triple {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,589 INFO L290 TraceCheckUtils]: 141: Hoare triple {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,589 INFO L290 TraceCheckUtils]: 142: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,590 INFO L290 TraceCheckUtils]: 143: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,590 INFO L290 TraceCheckUtils]: 144: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,590 INFO L290 TraceCheckUtils]: 145: Hoare triple {142753#(= 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); {142753#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 146: Hoare triple {142753#(= 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); {142784#(= |ssl3_connect_#t~mem53| 4400)} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 147: Hoare triple {142784#(= |ssl3_connect_#t~mem53| 4400)} assume 4099 == #t~mem53;havoc #t~mem53; {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 148: Hoare triple {142332#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 149: Hoare triple {142332#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 150: Hoare triple {142332#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 151: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 152: Hoare triple {142332#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 153: Hoare triple {142332#false} assume !(0 == ~tmp___4~0); {142332#false} is VALID [2022-04-08 08:48:44,591 INFO L290 TraceCheckUtils]: 154: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 155: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 156: Hoare triple {142332#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 157: Hoare triple {142332#false} ~skip~0 := 0; {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 158: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 159: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 160: Hoare triple {142332#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 161: Hoare triple {142332#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 162: Hoare triple {142332#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 163: Hoare triple {142332#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 164: Hoare triple {142332#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 165: Hoare triple {142332#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 166: Hoare triple {142332#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 167: Hoare triple {142332#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,592 INFO L290 TraceCheckUtils]: 168: Hoare triple {142332#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 169: Hoare triple {142332#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 170: Hoare triple {142332#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 171: Hoare triple {142332#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 172: Hoare triple {142332#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 173: Hoare triple {142332#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 174: Hoare triple {142332#false} assume 4433 == #t~mem63;havoc #t~mem63; {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 175: Hoare triple {142332#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 176: Hoare triple {142332#false} assume 5 == ~blastFlag~0; {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L290 TraceCheckUtils]: 177: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-08 08:48:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 172 proven. 78 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-04-08 08:48:44,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:48:44,869 INFO L290 TraceCheckUtils]: 177: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-08 08:48:44,869 INFO L290 TraceCheckUtils]: 176: Hoare triple {142332#false} assume 5 == ~blastFlag~0; {142332#false} is VALID [2022-04-08 08:48:44,869 INFO L290 TraceCheckUtils]: 175: Hoare triple {142332#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 174: Hoare triple {142332#false} assume 4433 == #t~mem63;havoc #t~mem63; {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 173: Hoare triple {142332#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 172: Hoare triple {142332#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 171: Hoare triple {142332#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 170: Hoare triple {142332#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 169: Hoare triple {142332#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 168: Hoare triple {142332#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 167: Hoare triple {142332#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 166: Hoare triple {142332#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 165: Hoare triple {142332#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 164: Hoare triple {142332#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 163: Hoare triple {142332#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 162: Hoare triple {142332#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,870 INFO L290 TraceCheckUtils]: 161: Hoare triple {142332#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 160: Hoare triple {142332#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 159: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 158: Hoare triple {142332#false} assume !false; {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 157: Hoare triple {142332#false} ~skip~0 := 0; {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 156: Hoare triple {142332#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 155: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 154: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 153: Hoare triple {142332#false} assume !(0 == ~tmp___4~0); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 152: Hoare triple {142332#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 151: Hoare triple {142332#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); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 150: Hoare triple {142332#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 149: Hoare triple {142332#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142332#false} is VALID [2022-04-08 08:48:44,871 INFO L290 TraceCheckUtils]: 148: Hoare triple {142332#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142332#false} is VALID [2022-04-08 08:48:44,872 INFO L290 TraceCheckUtils]: 147: Hoare triple {142339#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {142332#false} is VALID [2022-04-08 08:48:44,872 INFO L290 TraceCheckUtils]: 146: Hoare triple {142337#(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); {142339#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-08 08:48:44,872 INFO L290 TraceCheckUtils]: 145: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,873 INFO L290 TraceCheckUtils]: 144: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,873 INFO L290 TraceCheckUtils]: 143: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,873 INFO L290 TraceCheckUtils]: 142: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,873 INFO L290 TraceCheckUtils]: 141: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,874 INFO L290 TraceCheckUtils]: 140: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,874 INFO L290 TraceCheckUtils]: 139: Hoare triple {142337#(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; {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,874 INFO L290 TraceCheckUtils]: 138: Hoare triple {142337#(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); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,875 INFO L290 TraceCheckUtils]: 137: Hoare triple {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 136: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142337#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 135: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 134: Hoare triple {142331#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 133: Hoare triple {142331#true} assume !(1 == ~blastFlag~0); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 132: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 131: Hoare triple {142331#true} assume 4385 == #t~mem57;havoc #t~mem57; {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 130: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 129: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 128: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 127: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 126: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 125: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,876 INFO L290 TraceCheckUtils]: 124: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 123: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 122: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 121: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 120: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 119: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 118: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 117: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 116: Hoare triple {142331#true} assume !(5 == ~blastFlag~0); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 115: Hoare triple {142331#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 114: Hoare triple {142331#true} assume 4432 == #t~mem62;havoc #t~mem62; {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,877 INFO L290 TraceCheckUtils]: 111: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 110: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 109: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 108: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 107: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 106: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 105: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 104: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 103: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 102: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 99: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,878 INFO L290 TraceCheckUtils]: 97: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 96: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 95: Hoare triple {142331#true} assume !(0 == ~tmp___6~0); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 94: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 93: Hoare triple {142331#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 92: Hoare triple {142331#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 91: Hoare triple {142331#true} assume 4416 == #t~mem60;havoc #t~mem60; {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {142331#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {142331#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {142331#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {142331#true} assume !(~ret~0 <= 0); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {142331#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {142331#true} assume 4400 == #t~mem58;havoc #t~mem58; {142331#true} is VALID [2022-04-08 08:48:44,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {142331#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {142331#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {142331#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {142331#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {142331#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {142331#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {142331#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {142331#true} assume 4384 == #t~mem56;havoc #t~mem56; {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {142331#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {142331#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {142331#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {142331#true} assume 4368 == #t~mem54;havoc #t~mem54; {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {142331#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {142331#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {142331#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {142331#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {142331#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {142331#true} ~skip~0 := 0; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {142331#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {142331#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {142331#true} assume !(0 == ~tmp___4~0); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {142331#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {142331#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {142331#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {142331#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {142331#true} assume 12292 == #t~mem49;havoc #t~mem49; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {142331#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {142331#true} assume !false; {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {142331#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142331#true} is VALID [2022-04-08 08:48:44,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {142331#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {142331#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; {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {142331#true} call #t~ret158 := main(); {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142331#true} {142331#true} #593#return; {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {142331#true} assume true; {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {142331#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); {142331#true} is VALID [2022-04-08 08:48:44,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {142331#true} call ULTIMATE.init(); {142331#true} is VALID [2022-04-08 08:48:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-04-08 08:48:44,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048765487] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:48:44,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:48:44,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-08 08:48:44,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:44,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390479672] [2022-04-08 08:48:44,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390479672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:44,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:44,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:48:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682334330] [2022-04-08 08:48:44,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:44,887 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 178 [2022-04-08 08:48:44,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:44,887 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:48:44,960 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:48:44,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:48:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:48:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:48:44,961 INFO L87 Difference]: Start difference. First operand 1225 states and 1745 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:48:48,996 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:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:52,922 INFO L93 Difference]: Finished difference Result 2778 states and 3958 transitions. [2022-04-08 08:48:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:48:52,922 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 178 [2022-04-08 08:48:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:52,923 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:48:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:48:52,925 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:48:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:48:52,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-08 08:48:53,274 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:48:53,379 INFO L225 Difference]: With dead ends: 2778 [2022-04-08 08:48:53,379 INFO L226 Difference]: Without dead ends: 1569 [2022-04-08 08:48:53,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 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:48:53,381 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:53,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 282 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:48:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-04-08 08:48:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1225. [2022-04-08 08:48:54,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:54,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1569 states. Second operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call 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:54,090 INFO L74 IsIncluded]: Start isIncluded. First operand 1569 states. Second operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call 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:54,091 INFO L87 Difference]: Start difference. First operand 1569 states. Second operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call 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:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:54,154 INFO L93 Difference]: Finished difference Result 1569 states and 2209 transitions. [2022-04-08 08:48:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2209 transitions. [2022-04-08 08:48:54,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:54,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:54,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 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 1569 states. [2022-04-08 08:48:54,158 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 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 1569 states. [2022-04-08 08:48:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:54,221 INFO L93 Difference]: Finished difference Result 1569 states and 2209 transitions. [2022-04-08 08:48:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2209 transitions. [2022-04-08 08:48:54,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:54,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:54,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:54,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.407377049180328) internal successors, (1717), 1220 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call 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:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1721 transitions. [2022-04-08 08:48:54,274 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1721 transitions. Word has length 178 [2022-04-08 08:48:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:54,274 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1721 transitions. [2022-04-08 08:48:54,274 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:48:54,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1721 transitions. [2022-04-08 08:48:55,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1721 transitions. [2022-04-08 08:48:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-08 08:48:55,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:55,784 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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] [2022-04-08 08:48:55,822 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:48:55,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 08:48:55,999 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1310777641, now seen corresponding path program 1 times [2022-04-08 08:48:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:56,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [738112280]