/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:14:50,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:14:50,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:14:50,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:14:50,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:14:50,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:14:50,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:14:50,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:14:50,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:14:50,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:14:50,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:14:50,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:14:50,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:14:50,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:14:50,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:14:50,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:14:50,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:14:50,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:14:50,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:14:50,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:14:50,366 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:14:50,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:14:50,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:14:50,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:14:50,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:14:50,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:14:50,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:14:50,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:14:50,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:14:50,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:14:50,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:14:50,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:14:50,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:14:50,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:14:50,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:14:50,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:14:50,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:14:50,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:14:50,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:14:50,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:14:50,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:14:50,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:14:50,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:14:50,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:14:50,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:14:50,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:14:50,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:14:50,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:14:50,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:14:50,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:14:50,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:14:50,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:14:50,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:14:50,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:14:50,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:14:50,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:14:50,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:14:50,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:14:50,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:14:50,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:14:50,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:14:50,404 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:14:50,404 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:14:50,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:14:50,404 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:14:50,404 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:14:50,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:14:50,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:14:50,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:14:50,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:14:50,630 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:14:50,631 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-15 18:14:50,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb937d3f/9ff6f2fde30a489b803e890defcc4828/FLAG594809c6b [2022-04-15 18:14:51,106 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:14:51,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-2.c [2022-04-15 18:14:51,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb937d3f/9ff6f2fde30a489b803e890defcc4828/FLAG594809c6b [2022-04-15 18:14:51,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb937d3f/9ff6f2fde30a489b803e890defcc4828 [2022-04-15 18:14:51,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:14:51,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:14:51,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:14:51,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:14:51,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:14:51,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:51" (1/1) ... [2022-04-15 18:14:51,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329307d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:51, skipping insertion in model container [2022-04-15 18:14:51,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:51" (1/1) ... [2022-04-15 18:14:51,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:14:51,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:14:52,078 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-15 18:14:52,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:14:52,098 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:14:52,158 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-15 18:14:52,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:14:52,175 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:14:52,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52 WrapperNode [2022-04-15 18:14:52,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:14:52,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:14:52,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:14:52,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:14:52,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:14:52,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:14:52,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:14:52,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:14:52,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (1/1) ... [2022-04-15 18:14:52,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:14:52,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:14:52,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:14:52,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:14:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:14:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:14:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:14:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 18:14:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 18:14:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:14:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 18:14:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:14:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:14:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:14:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:14:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:14:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:14:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:14:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 18:14:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:14:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:14:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:14:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:14:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:14:52,601 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:14:52,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:14:54,199 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:14:54,633 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 18:14:54,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 18:14:54,643 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:14:54,649 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:14:54,649 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:14:54,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:54 BoogieIcfgContainer [2022-04-15 18:14:54,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:14:54,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:14:54,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:14:54,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:14:54,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:14:51" (1/3) ... [2022-04-15 18:14:54,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9d1c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:54, skipping insertion in model container [2022-04-15 18:14:54,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:52" (2/3) ... [2022-04-15 18:14:54,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9d1c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:54, skipping insertion in model container [2022-04-15 18:14:54,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:54" (3/3) ... [2022-04-15 18:14:54,656 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2022-04-15 18:14:54,659 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:14:54,659 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:14:54,708 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:14:54,712 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:14:54,712 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:14:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:14:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:14:54,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:14:54,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:14:54,760 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:14:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:14:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 18:14:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:54,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1431587389] [2022-04-15 18:14:54,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:14:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 18:14:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:14:54,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821805871] [2022-04-15 18:14:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:14:54,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:14:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:14:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:55,242 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(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 18:14:55,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 18:14:55,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 18:14:55,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:14:55,245 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(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 18:14:55,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 18:14:55,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 18:14:55,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 18:14:55,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-15 18:14:55,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-15 18:14:55,248 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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:14:55,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~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) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:14:55,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:14:55,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 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) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:14:55,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:14:55,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-15 18:14:55,251 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, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-15 18:14:55,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-15 18:14:55,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 18:14:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:14:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:14:55,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821805871] [2022-04-15 18:14:55,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821805871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:55,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:55,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:14:55,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:14:55,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1431587389] [2022-04-15 18:14:55,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1431587389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:55,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:55,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:14:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448979429] [2022-04-15 18:14:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:14:55,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:14:55,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:14:55,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:55,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:55,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:14:55,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:14:55,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:14:55,321 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:57,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:58,389 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 18:14:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:14:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:14:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:14:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:14:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:14:58,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 18:14:58,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:58,708 INFO L225 Difference]: With dead ends: 267 [2022-04-15 18:14:58,709 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 18:14:58,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:14:58,713 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:14:58,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:14:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 18:14:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 18:14:58,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:14:58,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,740 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,740 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:58,745 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 18:14:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 18:14:58,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:58,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:58,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 18:14:58,747 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 18:14:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:58,751 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 18:14:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 18:14:58,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:58,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:58,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:14:58,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:14:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 18:14:58,757 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 18:14:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:14:58,757 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 18:14:58,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:58,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 18:14:58,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 18:14:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 18:14:58,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:14:58,877 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:14:58,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:14:58,877 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:14:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:14:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 18:14:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:58,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2061898190] [2022-04-15 18:14:58,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:14:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 18:14:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:14:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211099302] [2022-04-15 18:14:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:14:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:14:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:59,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:14:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:59,152 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(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 18:14:59,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 18:14:59,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 18:14:59,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:14:59,153 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(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 18:14:59,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 18:14:59,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 18:14:59,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 18:14:59,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-15 18:14:59,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-15 18:14:59,163 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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,168 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, 80 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,171 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,171 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,172 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,172 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,172 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,173 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,173 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,173 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,174 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,174 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,174 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,174 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,175 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, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:14:59,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 18:14:59,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 18:14:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:14:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:14:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211099302] [2022-04-15 18:14:59,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211099302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:59,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:59,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:14:59,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:14:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2061898190] [2022-04-15 18:14:59,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2061898190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:59,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:59,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:14:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176054315] [2022-04-15 18:14:59,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:14:59,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 18:14:59,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:14:59,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:59,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:59,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:14:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:14:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:14:59,237 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:01,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:01,822 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 18:15:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:15:01,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 18:15:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:15:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 18:15:01,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 18:15:02,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:02,159 INFO L225 Difference]: With dead ends: 327 [2022-04-15 18:15:02,159 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 18:15:02,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:02,160 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:02,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 18:15:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 18:15:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 18:15:02,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:02,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:02,172 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:02,173 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:02,178 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 18:15:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:15:02,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:02,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:02,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 18:15:02,181 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 18:15:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:02,187 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 18:15:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:15:02,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:02,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:02,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:02,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 18:15:02,194 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 18:15:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:02,194 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 18:15:02,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:02,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 18:15:02,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 18:15:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 18:15:02,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:02,438 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:02,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:15:02,439 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 18:15:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:02,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302613756] [2022-04-15 18:15:02,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 18:15:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:02,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081995411] [2022-04-15 18:15:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:02,678 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(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 18:15:02,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 18:15:02,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 18:15:02,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:02,680 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(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 18:15:02,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 18:15:02,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 18:15:02,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 18:15:02,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2724#true} is VALID [2022-04-15 18:15:02,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-15 18:15:02,682 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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {2724#true} is VALID [2022-04-15 18:15:02,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2724#true} is VALID [2022-04-15 18:15:02,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {2724#true} is VALID [2022-04-15 18:15:02,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-15 18:15:02,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 18:15:02,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 18:15:02,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2724#true} is VALID [2022-04-15 18:15:02,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2724#true} is VALID [2022-04-15 18:15:02,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,683 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, 80 + ~s.offset, 8); {2724#true} is VALID [2022-04-15 18:15:02,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-15 18:15:02,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 18:15:02,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-15 18:15:02,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 18:15:02,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 18:15:02,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 18:15:02,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 18:15:02,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2724#true} is VALID [2022-04-15 18:15:02,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 18:15:02,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:02,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2730#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-15 18:15:02,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {2730#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 18:15:02,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-15 18:15:02,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 18:15:02,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 18:15:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:15:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:02,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081995411] [2022-04-15 18:15:02,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081995411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:02,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:02,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:02,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:02,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302613756] [2022-04-15 18:15:02,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302613756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:02,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:02,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219690937] [2022-04-15 18:15:02,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:02,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 18:15:02,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:02,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:02,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:02,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:15:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:15:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:15:02,770 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:04,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:05,717 INFO L93 Difference]: Finished difference Result 611 states and 908 transitions. [2022-04-15 18:15:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:15:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 18:15:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:15:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:15:05,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:15:06,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:06,086 INFO L225 Difference]: With dead ends: 611 [2022-04-15 18:15:06,087 INFO L226 Difference]: Without dead ends: 405 [2022-04-15 18:15:06,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:15:06,088 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:06,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 279 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:15:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-15 18:15:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 270. [2022-04-15 18:15:06,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:06,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:06,106 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:06,106 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:06,116 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 18:15:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 18:15:06,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:06,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:06,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 18:15:06,118 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-15 18:15:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:06,129 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-15 18:15:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-15 18:15:06,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:06,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:06,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:06,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2022-04-15 18:15:06,137 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 410 transitions. Word has length 59 [2022-04-15 18:15:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:06,137 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 410 transitions. [2022-04-15 18:15:06,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:06,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 410 transitions. [2022-04-15 18:15:06,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 410 transitions. [2022-04-15 18:15:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 18:15:06,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:06,432 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, 1] [2022-04-15 18:15:06,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:15:06,432 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 1 times [2022-04-15 18:15:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:06,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147818421] [2022-04-15 18:15:06,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 2 times [2022-04-15 18:15:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:06,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114031348] [2022-04-15 18:15:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:06,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {5308#true} is VALID [2022-04-15 18:15:06,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-15 18:15:06,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-15 18:15:06,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:06,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {5315#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {5308#true} is VALID [2022-04-15 18:15:06,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-15 18:15:06,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-15 18:15:06,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret158 := main(); {5308#true} is VALID [2022-04-15 18:15:06,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {5308#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {5308#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {5308#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {5308#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {5308#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {5308#true} assume 12292 == #t~mem49;havoc #t~mem49; {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {5308#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {5308#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {5308#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {5308#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {5308#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, 80 + ~s.offset, 8); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#true} assume !(0 == ~tmp___4~0); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {5308#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {5308#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {5308#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#true} ~skip~0 := 0; {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {5308#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {5308#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {5308#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {5308#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {5308#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-15 18:15:06,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {5308#true} assume 4368 == #t~mem54;havoc #t~mem54; {5308#true} is VALID [2022-04-15 18:15:06,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {5308#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {5308#true} is VALID [2022-04-15 18:15:06,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {5308#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5308#true} is VALID [2022-04-15 18:15:06,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {5308#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:15:06,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5314#(not (= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-15 18:15:06,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {5314#(not (= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {5309#false} is VALID [2022-04-15 18:15:06,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {5309#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {5309#false} is VALID [2022-04-15 18:15:06,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {5309#false} assume 5 == ~blastFlag~0; {5309#false} is VALID [2022-04-15 18:15:06,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2022-04-15 18:15:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:15:06,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:06,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114031348] [2022-04-15 18:15:06,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114031348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:06,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:06,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:06,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:06,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147818421] [2022-04-15 18:15:06,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147818421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:06,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:06,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:06,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861462601] [2022-04-15 18:15:06,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:06,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 18:15:06,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:06,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:06,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:06,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:15:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:15:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:15:06,652 INFO L87 Difference]: Start difference. First operand 270 states and 410 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:08,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:09,589 INFO L93 Difference]: Finished difference Result 707 states and 1076 transitions. [2022-04-15 18:15:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:15:09,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 18:15:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:15:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 18:15:09,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 18:15:09,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:09,887 INFO L225 Difference]: With dead ends: 707 [2022-04-15 18:15:09,887 INFO L226 Difference]: Without dead ends: 453 [2022-04-15 18:15:09,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:15:09,888 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:09,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:15:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-15 18:15:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 320. [2022-04-15 18:15:09,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:09,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,904 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,904 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:09,914 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-15 18:15:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-15 18:15:09,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:09,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:09,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 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 453 states. [2022-04-15 18:15:09,916 INFO L87 Difference]: Start difference. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 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 453 states. [2022-04-15 18:15:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:09,926 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-15 18:15:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-15 18:15:09,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:09,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:09,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:09,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 498 transitions. [2022-04-15 18:15:09,933 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 498 transitions. Word has length 60 [2022-04-15 18:15:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:09,933 INFO L478 AbstractCegarLoop]: Abstraction has 320 states and 498 transitions. [2022-04-15 18:15:09,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:09,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 320 states and 498 transitions. [2022-04-15 18:15:10,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 498 transitions. [2022-04-15 18:15:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 18:15:10,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:10,256 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 18:15:10,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:15:10,256 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 1 times [2022-04-15 18:15:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:10,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1105904793] [2022-04-15 18:15:10,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 2 times [2022-04-15 18:15:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:10,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210720897] [2022-04-15 18:15:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:10,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:10,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {8280#true} is VALID [2022-04-15 18:15:10,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-15 18:15:10,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {8280#true} call ULTIMATE.init(); {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:10,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {8286#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {8280#true} call #t~ret158 := main(); {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {8280#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {8280#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {8280#true} is VALID [2022-04-15 18:15:10,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8280#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {8280#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {8280#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {8280#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {8280#true} assume 12292 == #t~mem49;havoc #t~mem49; {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {8280#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {8280#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {8280#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {8280#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {8280#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, 80 + ~s.offset, 8); {8280#true} is VALID [2022-04-15 18:15:10,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {8280#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {8280#true} assume !(0 == ~tmp___4~0); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {8280#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {8280#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {8280#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {8280#true} ~skip~0 := 0; {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {8280#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {8280#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {8280#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {8280#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {8280#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-15 18:15:10,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {8280#true} assume 4368 == #t~mem54;havoc #t~mem54; {8280#true} is VALID [2022-04-15 18:15:10,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {8280#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {8280#true} is VALID [2022-04-15 18:15:10,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {8280#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 4416 == #t~mem60;havoc #t~mem60; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {8281#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {8281#false} assume !(0 == ~tmp___6~0); {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {8281#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {8281#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {8281#false} ~skip~0 := 0; {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-15 18:15:10,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {8281#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {8281#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {8281#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {8281#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {8281#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {8281#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {8281#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 69: Hoare triple {8281#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 70: Hoare triple {8281#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 71: Hoare triple {8281#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 72: Hoare triple {8281#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 73: Hoare triple {8281#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 74: Hoare triple {8281#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 75: Hoare triple {8281#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-15 18:15:10,477 INFO L290 TraceCheckUtils]: 76: Hoare triple {8281#false} assume 4432 == #t~mem62;havoc #t~mem62; {8281#false} is VALID [2022-04-15 18:15:10,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {8281#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {8281#false} is VALID [2022-04-15 18:15:10,478 INFO L290 TraceCheckUtils]: 78: Hoare triple {8281#false} assume 5 == ~blastFlag~0; {8281#false} is VALID [2022-04-15 18:15:10,478 INFO L290 TraceCheckUtils]: 79: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-15 18:15:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:15:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210720897] [2022-04-15 18:15:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210720897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:10,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:10,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:10,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:10,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1105904793] [2022-04-15 18:15:10,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1105904793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:10,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:10,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627108271] [2022-04-15 18:15:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 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 80 [2022-04-15 18:15:10,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:10,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:10,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:10,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:15:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:15:10,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:10,530 INFO L87 Difference]: Start difference. First operand 320 states and 498 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:12,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:13,403 INFO L93 Difference]: Finished difference Result 622 states and 979 transitions. [2022-04-15 18:15:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:15:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 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 80 [2022-04-15 18:15:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2022-04-15 18:15:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2022-04-15 18:15:13,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 484 transitions. [2022-04-15 18:15:13,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:13,749 INFO L225 Difference]: With dead ends: 622 [2022-04-15 18:15:13,749 INFO L226 Difference]: Without dead ends: 468 [2022-04-15 18:15:13,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:13,751 INFO L913 BasicCegarLoop]: 308 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:13,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 470 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:15:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-15 18:15:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-04-15 18:15:13,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:13,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,789 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,790 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:13,799 INFO L93 Difference]: Finished difference Result 468 states and 730 transitions. [2022-04-15 18:15:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-15 18:15:13,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:13,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:13,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 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 468 states. [2022-04-15 18:15:13,801 INFO L87 Difference]: Start difference. First operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 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 468 states. [2022-04-15 18:15:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:13,813 INFO L93 Difference]: Finished difference Result 468 states and 730 transitions. [2022-04-15 18:15:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-15 18:15:13,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:13,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:13,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:13,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 730 transitions. [2022-04-15 18:15:13,825 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 730 transitions. Word has length 80 [2022-04-15 18:15:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:13,826 INFO L478 AbstractCegarLoop]: Abstraction has 468 states and 730 transitions. [2022-04-15 18:15:13,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:13,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 468 states and 730 transitions. [2022-04-15 18:15:14,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-15 18:15:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 18:15:14,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:14,261 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:14,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:15:14,262 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:14,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash 359133942, now seen corresponding path program 1 times [2022-04-15 18:15:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:14,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284640033] [2022-04-15 18:15:14,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash 359133942, now seen corresponding path program 2 times [2022-04-15 18:15:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:14,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120381815] [2022-04-15 18:15:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:14,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {11411#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {11405#true} is VALID [2022-04-15 18:15:14,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {11405#true} assume true; {11405#true} is VALID [2022-04-15 18:15:14,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11405#true} {11405#true} #593#return; {11405#true} is VALID [2022-04-15 18:15:14,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {11405#true} call ULTIMATE.init(); {11411#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {11411#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {11405#true} assume true; {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11405#true} {11405#true} #593#return; {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {11405#true} call #t~ret158 := main(); {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {11405#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {11405#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {11405#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {11405#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {11405#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {11405#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {11405#true} assume !false; {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {11405#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {11405#true} assume 12292 == #t~mem49;havoc #t~mem49; {11405#true} is VALID [2022-04-15 18:15:14,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {11405#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11405#true} is VALID [2022-04-15 18:15:14,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {11405#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {11405#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {11405#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {11405#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, 80 + ~s.offset, 8); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {11405#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {11405#true} assume !(0 == ~tmp___4~0); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {11405#true} ~skip~0 := 0; {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {11405#true} assume !false; {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {11405#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {11405#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {11405#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {11405#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {11405#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {11405#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {11405#true} assume 4368 == #t~mem54;havoc #t~mem54; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {11405#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {11405#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {11405#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {11405#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {11405#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {11405#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {11405#true} ~skip~0 := 0; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {11405#true} assume !false; {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {11405#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {11405#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {11405#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {11405#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {11405#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {11405#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {11405#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {11405#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11405#true} is VALID [2022-04-15 18:15:14,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {11405#true} assume 4384 == #t~mem56;havoc #t~mem56; {11405#true} is VALID [2022-04-15 18:15:14,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {11405#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11405#true} is VALID [2022-04-15 18:15:14,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {11405#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,455 INFO L290 TraceCheckUtils]: 59: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,458 INFO L290 TraceCheckUtils]: 70: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {11410#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 73: Hoare triple {11410#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {11406#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 75: Hoare triple {11406#false} assume !(0 == ~tmp___6~0); {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {11406#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {11406#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 78: Hoare triple {11406#false} ~skip~0 := 0; {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 79: Hoare triple {11406#false} assume !false; {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 80: Hoare triple {11406#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 81: Hoare triple {11406#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,459 INFO L290 TraceCheckUtils]: 82: Hoare triple {11406#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {11406#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {11406#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {11406#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {11406#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 87: Hoare triple {11406#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {11406#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {11406#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {11406#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {11406#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {11406#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {11406#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {11406#false} assume 4432 == #t~mem62;havoc #t~mem62; {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {11406#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {11406#false} assume 5 == ~blastFlag~0; {11406#false} is VALID [2022-04-15 18:15:14,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {11406#false} assume !false; {11406#false} is VALID [2022-04-15 18:15:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 18:15:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:14,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120381815] [2022-04-15 18:15:14,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120381815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:14,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:14,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:14,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:14,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284640033] [2022-04-15 18:15:14,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284640033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:14,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:14,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783137875] [2022-04-15 18:15:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 18:15:14,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:14,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:14,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:14,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:15:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:15:14,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:14,530 INFO L87 Difference]: Start difference. First operand 468 states and 730 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:16,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:17,340 INFO L93 Difference]: Finished difference Result 921 states and 1448 transitions. [2022-04-15 18:15:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:15:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 18:15:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 18:15:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 18:15:17,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 18:15:17,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:17,722 INFO L225 Difference]: With dead ends: 921 [2022-04-15 18:15:17,723 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 18:15:17,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:17,725 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:17,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 18:15:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 18:15:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-15 18:15:17,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:17,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,745 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,745 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:17,760 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-15 18:15:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:15:17,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:17,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:17,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-15 18:15:17,763 INFO L87 Difference]: Start difference. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-15 18:15:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:17,777 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-15 18:15:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:15:17,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:17,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:17,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:17,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-15 18:15:17,796 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-15 18:15:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:17,796 INFO L478 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-15 18:15:17,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:17,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-15 18:15:18,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-15 18:15:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 18:15:18,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:18,549 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:18,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:15:18,549 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-15 18:15:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:18,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036266724] [2022-04-15 18:15:18,550 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 2 times [2022-04-15 18:15:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:18,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643238096] [2022-04-15 18:15:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:18,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {15738#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {15732#true} is VALID [2022-04-15 18:15:18,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {15732#true} assume true; {15732#true} is VALID [2022-04-15 18:15:18,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15732#true} {15732#true} #593#return; {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {15732#true} call ULTIMATE.init(); {15738#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {15738#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {15732#true} assume true; {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15732#true} {15732#true} #593#return; {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {15732#true} call #t~ret158 := main(); {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {15732#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {15732#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {15732#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {15732#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {15732#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {15732#true} is VALID [2022-04-15 18:15:18,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {15732#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {15732#true} assume !false; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {15732#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {15732#true} assume 12292 == #t~mem49;havoc #t~mem49; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {15732#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {15732#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {15732#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {15732#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {15732#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, 80 + ~s.offset, 8); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {15732#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {15732#true} assume !(0 == ~tmp___4~0); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {15732#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {15732#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {15732#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {15732#true} ~skip~0 := 0; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {15732#true} assume !false; {15732#true} is VALID [2022-04-15 18:15:18,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {15732#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {15732#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {15732#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {15732#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {15732#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {15732#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {15732#true} assume 4368 == #t~mem54;havoc #t~mem54; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {15732#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {15732#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {15732#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {15732#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {15732#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {15732#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {15732#true} ~skip~0 := 0; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {15732#true} assume !false; {15732#true} is VALID [2022-04-15 18:15:18,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {15732#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {15732#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {15732#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {15732#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {15732#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {15732#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {15732#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {15732#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {15732#true} assume 4384 == #t~mem56;havoc #t~mem56; {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {15732#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {15732#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {15732#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {15732#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {15732#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {15732#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {15732#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15732#true} is VALID [2022-04-15 18:15:18,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {15732#true} ~skip~0 := 0; {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {15732#true} assume !false; {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {15732#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {15732#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {15732#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {15732#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 63: Hoare triple {15732#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {15732#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {15732#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {15732#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {15732#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {15732#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {15732#true} assume 4400 == #t~mem58;havoc #t~mem58; {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {15732#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {15732#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {15732#true} is VALID [2022-04-15 18:15:18,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {15732#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {15732#true} assume !(~ret~0 <= 0); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {15732#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {15732#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {15732#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {15732#true} ~skip~0 := 0; {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {15732#true} assume !false; {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {15732#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {15732#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {15732#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 82: Hoare triple {15732#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {15732#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {15732#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {15732#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {15732#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {15732#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 88: Hoare triple {15732#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {15732#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 90: Hoare triple {15732#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15732#true} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 91: Hoare triple {15732#true} assume 4416 == #t~mem60;havoc #t~mem60; {15732#true} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 92: Hoare triple {15732#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {15732#true} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 93: Hoare triple {15732#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,717 INFO L290 TraceCheckUtils]: 94: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,718 INFO L290 TraceCheckUtils]: 95: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,718 INFO L290 TraceCheckUtils]: 96: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,718 INFO L290 TraceCheckUtils]: 97: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,718 INFO L290 TraceCheckUtils]: 98: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,719 INFO L290 TraceCheckUtils]: 99: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !false; {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,719 INFO L290 TraceCheckUtils]: 100: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,719 INFO L290 TraceCheckUtils]: 101: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,719 INFO L290 TraceCheckUtils]: 102: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,720 INFO L290 TraceCheckUtils]: 103: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,720 INFO L290 TraceCheckUtils]: 104: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,720 INFO L290 TraceCheckUtils]: 105: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,721 INFO L290 TraceCheckUtils]: 106: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,721 INFO L290 TraceCheckUtils]: 107: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,721 INFO L290 TraceCheckUtils]: 108: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,721 INFO L290 TraceCheckUtils]: 109: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,722 INFO L290 TraceCheckUtils]: 110: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,722 INFO L290 TraceCheckUtils]: 111: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,722 INFO L290 TraceCheckUtils]: 112: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,722 INFO L290 TraceCheckUtils]: 113: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,723 INFO L290 TraceCheckUtils]: 114: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,723 INFO L290 TraceCheckUtils]: 115: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15737#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:15:18,723 INFO L290 TraceCheckUtils]: 116: Hoare triple {15737#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {15733#false} is VALID [2022-04-15 18:15:18,723 INFO L290 TraceCheckUtils]: 117: Hoare triple {15733#false} assume !false; {15733#false} is VALID [2022-04-15 18:15:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 18:15:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:18,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643238096] [2022-04-15 18:15:18,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643238096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:18,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:18,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:18,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:18,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036266724] [2022-04-15 18:15:18,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036266724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:18,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:18,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339429515] [2022-04-15 18:15:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:18,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:15:18,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:18,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:18,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:18,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:15:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:15:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:18,818 INFO L87 Difference]: Start difference. First operand 619 states and 966 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:20,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:21,738 INFO L93 Difference]: Finished difference Result 1221 states and 1917 transitions. [2022-04-15 18:15:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:15:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:15:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 18:15:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-15 18:15:21,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-15 18:15:22,057 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-15 18:15:22,080 INFO L225 Difference]: With dead ends: 1221 [2022-04-15 18:15:22,080 INFO L226 Difference]: Without dead ends: 768 [2022-04-15 18:15:22,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:22,082 INFO L913 BasicCegarLoop]: 313 mSDtfsCounter, 124 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 475 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:22,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 475 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 18:15:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-04-15 18:15:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2022-04-15 18:15:22,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:22,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 768 states. Second operand has 768 states, 763 states have (on average 1.5661861074705112) internal successors, (1195), 763 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:22,104 INFO L74 IsIncluded]: Start isIncluded. First operand 768 states. Second operand has 768 states, 763 states have (on average 1.5661861074705112) internal successors, (1195), 763 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:22,105 INFO L87 Difference]: Start difference. First operand 768 states. Second operand has 768 states, 763 states have (on average 1.5661861074705112) internal successors, (1195), 763 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:22,125 INFO L93 Difference]: Finished difference Result 768 states and 1199 transitions. [2022-04-15 18:15:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1199 transitions. [2022-04-15 18:15:22,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:22,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:22,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 768 states, 763 states have (on average 1.5661861074705112) internal successors, (1195), 763 states have internal predecessors, (1195), 3 states have call successors, (3), 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 768 states. [2022-04-15 18:15:22,130 INFO L87 Difference]: Start difference. First operand has 768 states, 763 states have (on average 1.5661861074705112) internal successors, (1195), 763 states have internal predecessors, (1195), 3 states have call successors, (3), 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 768 states. [2022-04-15 18:15:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:22,149 INFO L93 Difference]: Finished difference Result 768 states and 1199 transitions. [2022-04-15 18:15:22,149 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1199 transitions. [2022-04-15 18:15:22,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:22,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:22,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:22,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 763 states have (on average 1.5661861074705112) internal successors, (1195), 763 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1199 transitions. [2022-04-15 18:15:22,201 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1199 transitions. Word has length 118 [2022-04-15 18:15:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:22,201 INFO L478 AbstractCegarLoop]: Abstraction has 768 states and 1199 transitions. [2022-04-15 18:15:22,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:22,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 768 states and 1199 transitions. [2022-04-15 18:15:23,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1199 edges. 1199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1199 transitions. [2022-04-15 18:15:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 18:15:23,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:23,072 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:23,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:15:23,072 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 20055697, now seen corresponding path program 1 times [2022-04-15 18:15:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771600821] [2022-04-15 18:15:23,073 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash 20055697, now seen corresponding path program 2 times [2022-04-15 18:15:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353461929] [2022-04-15 18:15:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:23,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:23,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {21261#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {21255#true} is VALID [2022-04-15 18:15:23,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {21255#true} assume true; {21255#true} is VALID [2022-04-15 18:15:23,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21255#true} {21255#true} #593#return; {21255#true} is VALID [2022-04-15 18:15:23,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {21255#true} call ULTIMATE.init(); {21261#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {21261#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {21255#true} assume true; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21255#true} {21255#true} #593#return; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {21255#true} call #t~ret158 := main(); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {21255#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {21255#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {21255#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {21255#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {21255#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {21255#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {21255#true} assume !false; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {21255#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {21255#true} assume 12292 == #t~mem49;havoc #t~mem49; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {21255#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {21255#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {21255#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {21255#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {21255#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, 80 + ~s.offset, 8); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {21255#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {21255#true} assume !(0 == ~tmp___4~0); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {21255#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {21255#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {21255#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {21255#true} ~skip~0 := 0; {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {21255#true} assume !false; {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {21255#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {21255#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {21255#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {21255#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {21255#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {21255#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {21255#true} assume 4368 == #t~mem54;havoc #t~mem54; {21255#true} is VALID [2022-04-15 18:15:23,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {21255#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {21255#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {21255#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {21255#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {21255#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {21255#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {21255#true} ~skip~0 := 0; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {21255#true} assume !false; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {21255#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {21255#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {21255#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {21255#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {21255#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {21255#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {21255#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {21255#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {21255#true} assume 4384 == #t~mem56;havoc #t~mem56; {21255#true} is VALID [2022-04-15 18:15:23,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {21255#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {21255#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {21255#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {21255#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {21255#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {21255#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {21255#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {21255#true} ~skip~0 := 0; {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {21255#true} assume !false; {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {21255#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {21255#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {21255#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {21255#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {21255#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {21255#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {21255#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {21255#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {21255#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {21255#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21255#true} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {21255#true} assume 4400 == #t~mem58;havoc #t~mem58; {21255#true} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {21255#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {21255#true} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {21255#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {21255#true} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {21255#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,238 INFO L290 TraceCheckUtils]: 75: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,239 INFO L290 TraceCheckUtils]: 79: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,240 INFO L290 TraceCheckUtils]: 83: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,241 INFO L290 TraceCheckUtils]: 87: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 91: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 92: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {21260#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 93: Hoare triple {21260#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {21256#false} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 94: Hoare triple {21256#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 95: Hoare triple {21256#false} assume !(0 == ~tmp___6~0); {21256#false} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 96: Hoare triple {21256#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,242 INFO L290 TraceCheckUtils]: 97: Hoare triple {21256#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21256#false} is VALID [2022-04-15 18:15:23,243 INFO L290 TraceCheckUtils]: 98: Hoare triple {21256#false} ~skip~0 := 0; {21256#false} is VALID [2022-04-15 18:15:23,243 INFO L290 TraceCheckUtils]: 99: Hoare triple {21256#false} assume !false; {21256#false} is VALID [2022-04-15 18:15:23,243 INFO L290 TraceCheckUtils]: 100: Hoare triple {21256#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {21256#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {21256#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 103: Hoare triple {21256#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 104: Hoare triple {21256#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 105: Hoare triple {21256#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 106: Hoare triple {21256#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,267 INFO L290 TraceCheckUtils]: 107: Hoare triple {21256#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {21256#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 109: Hoare triple {21256#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 110: Hoare triple {21256#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 111: Hoare triple {21256#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 112: Hoare triple {21256#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 113: Hoare triple {21256#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 114: Hoare triple {21256#false} assume 4432 == #t~mem62;havoc #t~mem62; {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 115: Hoare triple {21256#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 116: Hoare triple {21256#false} assume 5 == ~blastFlag~0; {21256#false} is VALID [2022-04-15 18:15:23,268 INFO L290 TraceCheckUtils]: 117: Hoare triple {21256#false} assume !false; {21256#false} is VALID [2022-04-15 18:15:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 18:15:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353461929] [2022-04-15 18:15:23,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353461929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:23,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:23,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:23,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:23,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771600821] [2022-04-15 18:15:23,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771600821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:23,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:23,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:15:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911245895] [2022-04-15 18:15:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:15:23,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:23,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:23,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:23,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:15:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:15:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:23,337 INFO L87 Difference]: Start difference. First operand 768 states and 1199 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:25,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:26,273 INFO L93 Difference]: Finished difference Result 1496 states and 2342 transitions. [2022-04-15 18:15:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:15:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 18:15:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 18:15:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 18:15:26,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 18:15:26,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:26,648 INFO L225 Difference]: With dead ends: 1496 [2022-04-15 18:15:26,648 INFO L226 Difference]: Without dead ends: 894 [2022-04-15 18:15:26,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:15:26,649 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:26,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:15:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-04-15 18:15:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2022-04-15 18:15:26,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:26,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 894 states. Second operand has 894 states, 889 states have (on average 1.5601799775028122) internal successors, (1387), 889 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,672 INFO L74 IsIncluded]: Start isIncluded. First operand 894 states. Second operand has 894 states, 889 states have (on average 1.5601799775028122) internal successors, (1387), 889 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,673 INFO L87 Difference]: Start difference. First operand 894 states. Second operand has 894 states, 889 states have (on average 1.5601799775028122) internal successors, (1387), 889 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:26,699 INFO L93 Difference]: Finished difference Result 894 states and 1391 transitions. [2022-04-15 18:15:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1391 transitions. [2022-04-15 18:15:26,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:26,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:26,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 894 states, 889 states have (on average 1.5601799775028122) internal successors, (1387), 889 states have internal predecessors, (1387), 3 states have call successors, (3), 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 894 states. [2022-04-15 18:15:26,715 INFO L87 Difference]: Start difference. First operand has 894 states, 889 states have (on average 1.5601799775028122) internal successors, (1387), 889 states have internal predecessors, (1387), 3 states have call successors, (3), 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 894 states. [2022-04-15 18:15:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:26,742 INFO L93 Difference]: Finished difference Result 894 states and 1391 transitions. [2022-04-15 18:15:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1391 transitions. [2022-04-15 18:15:26,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:26,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:26,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:26,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 889 states have (on average 1.5601799775028122) internal successors, (1387), 889 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1391 transitions. [2022-04-15 18:15:26,778 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1391 transitions. Word has length 118 [2022-04-15 18:15:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:26,778 INFO L478 AbstractCegarLoop]: Abstraction has 894 states and 1391 transitions. [2022-04-15 18:15:26,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:26,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 894 states and 1391 transitions. [2022-04-15 18:15:27,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1391 transitions. [2022-04-15 18:15:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-15 18:15:27,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:27,726 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:27,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:15:27,726 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1603582388, now seen corresponding path program 1 times [2022-04-15 18:15:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:27,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810737416] [2022-04-15 18:15:40,015 WARN L232 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:15:48,055 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:48,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1603582388, now seen corresponding path program 2 times [2022-04-15 18:15:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:48,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185163594] [2022-04-15 18:15:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:48,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {27839#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {27832#true} is VALID [2022-04-15 18:15:48,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {27832#true} assume true; {27832#true} is VALID [2022-04-15 18:15:48,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27832#true} {27832#true} #593#return; {27832#true} is VALID [2022-04-15 18:15:48,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {27832#true} call ULTIMATE.init(); {27839#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {27839#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {27832#true} assume true; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27832#true} {27832#true} #593#return; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {27832#true} call #t~ret158 := main(); {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {27832#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {27832#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {27832#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {27832#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {27832#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {27832#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {27832#true} assume !false; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {27832#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {27832#true} assume 12292 == #t~mem49;havoc #t~mem49; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {27832#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {27832#true} is VALID [2022-04-15 18:15:48,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {27832#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {27832#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {27832#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {27832#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, 80 + ~s.offset, 8); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {27832#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {27832#true} assume !(0 == ~tmp___4~0); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {27832#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {27832#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {27832#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {27832#true} ~skip~0 := 0; {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {27832#true} assume !false; {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {27832#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {27832#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {27832#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {27832#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {27832#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {27832#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {27832#true} assume 4368 == #t~mem54;havoc #t~mem54; {27832#true} is VALID [2022-04-15 18:15:48,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {27832#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {27832#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {27832#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {27832#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {27832#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {27832#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {27832#true} ~skip~0 := 0; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {27832#true} assume !false; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {27832#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {27832#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {27832#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {27832#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {27832#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {27832#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {27832#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {27832#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {27832#true} assume 4384 == #t~mem56;havoc #t~mem56; {27832#true} is VALID [2022-04-15 18:15:48,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {27832#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {27832#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {27832#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {27832#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {27832#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {27832#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {27832#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {27832#true} ~skip~0 := 0; {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {27832#true} assume !false; {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 59: Hoare triple {27832#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {27832#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {27832#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {27832#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {27832#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {27832#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {27832#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {27832#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,220 INFO L290 TraceCheckUtils]: 67: Hoare triple {27832#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {27832#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {27832#true} assume 4400 == #t~mem58;havoc #t~mem58; {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 70: Hoare triple {27832#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 71: Hoare triple {27832#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {27832#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 73: Hoare triple {27832#true} assume !(~ret~0 <= 0); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 74: Hoare triple {27832#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 75: Hoare triple {27832#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 76: Hoare triple {27832#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 77: Hoare triple {27832#true} ~skip~0 := 0; {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 78: Hoare triple {27832#true} assume !false; {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 79: Hoare triple {27832#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {27832#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {27832#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 82: Hoare triple {27832#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 83: Hoare triple {27832#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 84: Hoare triple {27832#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,221 INFO L290 TraceCheckUtils]: 85: Hoare triple {27832#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 86: Hoare triple {27832#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 87: Hoare triple {27832#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 88: Hoare triple {27832#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 89: Hoare triple {27832#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 90: Hoare triple {27832#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 91: Hoare triple {27832#true} assume 4416 == #t~mem60;havoc #t~mem60; {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 92: Hoare triple {27832#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27832#true} is VALID [2022-04-15 18:15:48,222 INFO L290 TraceCheckUtils]: 93: Hoare triple {27832#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {27832#true} is VALID [2022-04-15 18:15:48,223 INFO L290 TraceCheckUtils]: 94: Hoare triple {27832#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,223 INFO L290 TraceCheckUtils]: 95: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == ~tmp___6~0); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,224 INFO L290 TraceCheckUtils]: 96: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,224 INFO L290 TraceCheckUtils]: 97: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,224 INFO L290 TraceCheckUtils]: 98: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} ~skip~0 := 0; {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,224 INFO L290 TraceCheckUtils]: 99: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !false; {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,225 INFO L290 TraceCheckUtils]: 100: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,225 INFO L290 TraceCheckUtils]: 101: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,225 INFO L290 TraceCheckUtils]: 102: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,225 INFO L290 TraceCheckUtils]: 103: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,226 INFO L290 TraceCheckUtils]: 104: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,226 INFO L290 TraceCheckUtils]: 105: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,226 INFO L290 TraceCheckUtils]: 106: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-15 18:15:48,226 INFO L290 TraceCheckUtils]: 107: Hoare triple {27837#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27838#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 108: Hoare triple {27838#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 109: Hoare triple {27833#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 110: Hoare triple {27833#false} assume !(1 == ~blastFlag~0); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 111: Hoare triple {27833#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 112: Hoare triple {27833#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 113: Hoare triple {27833#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 114: Hoare triple {27833#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 115: Hoare triple {27833#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 116: Hoare triple {27833#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 117: Hoare triple {27833#false} ~skip~0 := 0; {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 118: Hoare triple {27833#false} assume !false; {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 119: Hoare triple {27833#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 120: Hoare triple {27833#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,227 INFO L290 TraceCheckUtils]: 121: Hoare triple {27833#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 122: Hoare triple {27833#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 123: Hoare triple {27833#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 124: Hoare triple {27833#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 125: Hoare triple {27833#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 126: Hoare triple {27833#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 127: Hoare triple {27833#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 128: Hoare triple {27833#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 129: Hoare triple {27833#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 130: Hoare triple {27833#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 131: Hoare triple {27833#false} assume 4416 == #t~mem60;havoc #t~mem60; {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 132: Hoare triple {27833#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 133: Hoare triple {27833#false} assume !(3 == ~blastFlag~0); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 134: Hoare triple {27833#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 135: Hoare triple {27833#false} assume !(0 == ~tmp___6~0); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 136: Hoare triple {27833#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 137: Hoare triple {27833#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 138: Hoare triple {27833#false} ~skip~0 := 0; {27833#false} is VALID [2022-04-15 18:15:48,228 INFO L290 TraceCheckUtils]: 139: Hoare triple {27833#false} assume !false; {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 140: Hoare triple {27833#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 141: Hoare triple {27833#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 142: Hoare triple {27833#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 143: Hoare triple {27833#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 144: Hoare triple {27833#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 145: Hoare triple {27833#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 146: Hoare triple {27833#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 147: Hoare triple {27833#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 148: Hoare triple {27833#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 149: Hoare triple {27833#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 150: Hoare triple {27833#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 151: Hoare triple {27833#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 152: Hoare triple {27833#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 153: Hoare triple {27833#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 154: Hoare triple {27833#false} assume 4432 == #t~mem62;havoc #t~mem62; {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 155: Hoare triple {27833#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {27833#false} is VALID [2022-04-15 18:15:48,229 INFO L290 TraceCheckUtils]: 156: Hoare triple {27833#false} assume 5 == ~blastFlag~0; {27833#false} is VALID [2022-04-15 18:15:48,230 INFO L290 TraceCheckUtils]: 157: Hoare triple {27833#false} assume !false; {27833#false} is VALID [2022-04-15 18:15:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-15 18:15:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:48,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185163594] [2022-04-15 18:15:48,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185163594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:48,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:48,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:48,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810737416] [2022-04-15 18:15:48,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810737416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:48,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:48,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243317579] [2022-04-15 18:15:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:48,231 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 158 [2022-04-15 18:15:48,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:48,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:48,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:48,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:15:48,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:15:48,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:15:48,304 INFO L87 Difference]: Start difference. First operand 894 states and 1391 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:50,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:51,500 INFO L93 Difference]: Finished difference Result 2284 states and 3511 transitions. [2022-04-15 18:15:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:15:51,500 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 158 [2022-04-15 18:15:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 18:15:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 18:15:51,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 18:15:51,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:51,890 INFO L225 Difference]: With dead ends: 2284 [2022-04-15 18:15:51,890 INFO L226 Difference]: Without dead ends: 1406 [2022-04-15 18:15:51,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:15:51,891 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-15 18:15:51,892 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-15 18:15:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-04-15 18:15:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 984. [2022-04-15 18:15:51,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:51,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1406 states. Second operand has 984 states, 979 states have (on average 1.5638406537282943) internal successors, (1531), 979 states have internal predecessors, (1531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:51,925 INFO L74 IsIncluded]: Start isIncluded. First operand 1406 states. Second operand has 984 states, 979 states have (on average 1.5638406537282943) internal successors, (1531), 979 states have internal predecessors, (1531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:51,925 INFO L87 Difference]: Start difference. First operand 1406 states. Second operand has 984 states, 979 states have (on average 1.5638406537282943) internal successors, (1531), 979 states have internal predecessors, (1531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:51,992 INFO L93 Difference]: Finished difference Result 1406 states and 2129 transitions. [2022-04-15 18:15:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2129 transitions. [2022-04-15 18:15:51,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:51,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:51,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 984 states, 979 states have (on average 1.5638406537282943) internal successors, (1531), 979 states have internal predecessors, (1531), 3 states have call successors, (3), 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 1406 states. [2022-04-15 18:15:51,995 INFO L87 Difference]: Start difference. First operand has 984 states, 979 states have (on average 1.5638406537282943) internal successors, (1531), 979 states have internal predecessors, (1531), 3 states have call successors, (3), 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 1406 states. [2022-04-15 18:15:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:52,049 INFO L93 Difference]: Finished difference Result 1406 states and 2129 transitions. [2022-04-15 18:15:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2129 transitions. [2022-04-15 18:15:52,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:52,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:52,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:52,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 979 states have (on average 1.5638406537282943) internal successors, (1531), 979 states have internal predecessors, (1531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1535 transitions. [2022-04-15 18:15:52,091 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1535 transitions. Word has length 158 [2022-04-15 18:15:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:52,092 INFO L478 AbstractCegarLoop]: Abstraction has 984 states and 1535 transitions. [2022-04-15 18:15:52,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:52,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 984 states and 1535 transitions. [2022-04-15 18:15:53,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1535 edges. 1535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1535 transitions. [2022-04-15 18:15:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 18:15:53,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:53,266 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] [2022-04-15 18:15:53,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:15:53,266 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash -278206575, now seen corresponding path program 1 times [2022-04-15 18:15:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:53,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515371946] [2022-04-15 18:16:09,941 WARN L232 SmtUtils]: Spent 12.20s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:16:19,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -278206575, now seen corresponding path program 2 times [2022-04-15 18:16:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:19,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620086561] [2022-04-15 18:16:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:19,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {37199#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {37192#true} is VALID [2022-04-15 18:16:19,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {37192#true} assume true; {37192#true} is VALID [2022-04-15 18:16:19,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37192#true} {37192#true} #593#return; {37192#true} is VALID [2022-04-15 18:16:19,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {37192#true} call ULTIMATE.init(); {37199#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:19,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {37199#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {37192#true} is VALID [2022-04-15 18:16:19,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {37192#true} assume true; {37192#true} is VALID [2022-04-15 18:16:19,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37192#true} {37192#true} #593#return; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {37192#true} call #t~ret158 := main(); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {37192#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {37192#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {37192#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {37192#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {37192#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {37192#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {37192#true} assume !false; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {37192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {37192#true} assume 12292 == #t~mem49;havoc #t~mem49; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {37192#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {37192#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {37192#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {37192#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {37192#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, 80 + ~s.offset, 8); {37192#true} is VALID [2022-04-15 18:16:19,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {37192#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {37192#true} assume !(0 == ~tmp___4~0); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {37192#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {37192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {37192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {37192#true} ~skip~0 := 0; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {37192#true} assume !false; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {37192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {37192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {37192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {37192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {37192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {37192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {37192#true} assume 4368 == #t~mem54;havoc #t~mem54; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {37192#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {37192#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {37192#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {37192#true} is VALID [2022-04-15 18:16:19,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {37192#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {37192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {37192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {37192#true} ~skip~0 := 0; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {37192#true} assume !false; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {37192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {37192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {37192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {37192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {37192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {37192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {37192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {37192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {37192#true} assume 4384 == #t~mem56;havoc #t~mem56; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {37192#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {37192#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {37192#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {37192#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {37192#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {37192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {37192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {37192#true} ~skip~0 := 0; {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {37192#true} assume !false; {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {37192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {37192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {37192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {37192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {37192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {37192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {37192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {37192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {37192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {37192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {37192#true} assume 4400 == #t~mem58;havoc #t~mem58; {37192#true} is VALID [2022-04-15 18:16:19,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {37192#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 71: Hoare triple {37192#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {37192#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {37192#true} assume !(~ret~0 <= 0); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {37192#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {37192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {37192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {37192#true} ~skip~0 := 0; {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {37192#true} assume !false; {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {37192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 80: Hoare triple {37192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 81: Hoare triple {37192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 82: Hoare triple {37192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 83: Hoare triple {37192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 84: Hoare triple {37192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 85: Hoare triple {37192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 86: Hoare triple {37192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,559 INFO L290 TraceCheckUtils]: 87: Hoare triple {37192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {37192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {37192#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,560 INFO L290 TraceCheckUtils]: 90: Hoare triple {37192#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37192#true} is VALID [2022-04-15 18:16:19,560 INFO L290 TraceCheckUtils]: 91: Hoare triple {37192#true} assume 4416 == #t~mem60;havoc #t~mem60; {37192#true} is VALID [2022-04-15 18:16:19,560 INFO L290 TraceCheckUtils]: 92: Hoare triple {37192#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37192#true} is VALID [2022-04-15 18:16:19,560 INFO L290 TraceCheckUtils]: 93: Hoare triple {37192#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37192#true} is VALID [2022-04-15 18:16:19,561 INFO L290 TraceCheckUtils]: 94: Hoare triple {37192#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,561 INFO L290 TraceCheckUtils]: 95: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,561 INFO L290 TraceCheckUtils]: 96: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,562 INFO L290 TraceCheckUtils]: 97: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,562 INFO L290 TraceCheckUtils]: 98: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,562 INFO L290 TraceCheckUtils]: 99: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,563 INFO L290 TraceCheckUtils]: 100: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,563 INFO L290 TraceCheckUtils]: 101: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,563 INFO L290 TraceCheckUtils]: 102: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,564 INFO L290 TraceCheckUtils]: 103: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,564 INFO L290 TraceCheckUtils]: 104: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,565 INFO L290 TraceCheckUtils]: 106: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,565 INFO L290 TraceCheckUtils]: 107: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:16:19,565 INFO L290 TraceCheckUtils]: 108: Hoare triple {37197#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37198#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-15 18:16:19,565 INFO L290 TraceCheckUtils]: 109: Hoare triple {37198#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 110: Hoare triple {37193#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 111: Hoare triple {37193#false} assume !(1 == ~blastFlag~0); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 112: Hoare triple {37193#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 113: Hoare triple {37193#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 114: Hoare triple {37193#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 115: Hoare triple {37193#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 116: Hoare triple {37193#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 117: Hoare triple {37193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 118: Hoare triple {37193#false} ~skip~0 := 0; {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 119: Hoare triple {37193#false} assume !false; {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 120: Hoare triple {37193#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 121: Hoare triple {37193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 122: Hoare triple {37193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 123: Hoare triple {37193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 124: Hoare triple {37193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 125: Hoare triple {37193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,566 INFO L290 TraceCheckUtils]: 126: Hoare triple {37193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 127: Hoare triple {37193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 128: Hoare triple {37193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 129: Hoare triple {37193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 130: Hoare triple {37193#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 131: Hoare triple {37193#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 132: Hoare triple {37193#false} assume 4416 == #t~mem60;havoc #t~mem60; {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 133: Hoare triple {37193#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 134: Hoare triple {37193#false} assume !(3 == ~blastFlag~0); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 135: Hoare triple {37193#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 136: Hoare triple {37193#false} assume !(0 == ~tmp___6~0); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 137: Hoare triple {37193#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 138: Hoare triple {37193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 139: Hoare triple {37193#false} ~skip~0 := 0; {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 140: Hoare triple {37193#false} assume !false; {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 141: Hoare triple {37193#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 142: Hoare triple {37193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,567 INFO L290 TraceCheckUtils]: 143: Hoare triple {37193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 144: Hoare triple {37193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 145: Hoare triple {37193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 146: Hoare triple {37193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 147: Hoare triple {37193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 148: Hoare triple {37193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 149: Hoare triple {37193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 150: Hoare triple {37193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 151: Hoare triple {37193#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 152: Hoare triple {37193#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 153: Hoare triple {37193#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 154: Hoare triple {37193#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 155: Hoare triple {37193#false} assume 4432 == #t~mem62;havoc #t~mem62; {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 156: Hoare triple {37193#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 157: Hoare triple {37193#false} assume 5 == ~blastFlag~0; {37193#false} is VALID [2022-04-15 18:16:19,568 INFO L290 TraceCheckUtils]: 158: Hoare triple {37193#false} assume !false; {37193#false} is VALID [2022-04-15 18:16:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-15 18:16:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:19,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620086561] [2022-04-15 18:16:19,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620086561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:19,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:19,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:19,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:19,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515371946] [2022-04-15 18:16:19,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515371946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:19,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:19,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38384546] [2022-04-15 18:16:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:19,570 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 159 [2022-04-15 18:16:19,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:19,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:19,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:19,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:19,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:19,642 INFO L87 Difference]: Start difference. First operand 984 states and 1535 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:21,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:22,850 INFO L93 Difference]: Finished difference Result 2334 states and 3578 transitions. [2022-04-15 18:16:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:22,850 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 159 [2022-04-15 18:16:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 18:16:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 18:16:22,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 18:16:23,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:23,253 INFO L225 Difference]: With dead ends: 2334 [2022-04-15 18:16:23,254 INFO L226 Difference]: Without dead ends: 1366 [2022-04-15 18:16:23,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:23,256 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 111 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:23,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:16:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2022-04-15 18:16:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 984. [2022-04-15 18:16:23,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:23,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1366 states. Second operand has 984 states, 979 states have (on average 1.5526046986721145) internal successors, (1520), 979 states have internal predecessors, (1520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,293 INFO L74 IsIncluded]: Start isIncluded. First operand 1366 states. Second operand has 984 states, 979 states have (on average 1.5526046986721145) internal successors, (1520), 979 states have internal predecessors, (1520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,293 INFO L87 Difference]: Start difference. First operand 1366 states. Second operand has 984 states, 979 states have (on average 1.5526046986721145) internal successors, (1520), 979 states have internal predecessors, (1520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:23,344 INFO L93 Difference]: Finished difference Result 1366 states and 2052 transitions. [2022-04-15 18:16:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2052 transitions. [2022-04-15 18:16:23,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:23,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:23,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 984 states, 979 states have (on average 1.5526046986721145) internal successors, (1520), 979 states have internal predecessors, (1520), 3 states have call successors, (3), 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 1366 states. [2022-04-15 18:16:23,348 INFO L87 Difference]: Start difference. First operand has 984 states, 979 states have (on average 1.5526046986721145) internal successors, (1520), 979 states have internal predecessors, (1520), 3 states have call successors, (3), 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 1366 states. [2022-04-15 18:16:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:23,398 INFO L93 Difference]: Finished difference Result 1366 states and 2052 transitions. [2022-04-15 18:16:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2052 transitions. [2022-04-15 18:16:23,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:23,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:23,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:23,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 979 states have (on average 1.5526046986721145) internal successors, (1520), 979 states have internal predecessors, (1520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1524 transitions. [2022-04-15 18:16:23,466 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1524 transitions. Word has length 159 [2022-04-15 18:16:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:23,466 INFO L478 AbstractCegarLoop]: Abstraction has 984 states and 1524 transitions. [2022-04-15 18:16:23,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 984 states and 1524 transitions. [2022-04-15 18:16:24,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1524 edges. 1524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1524 transitions. [2022-04-15 18:16:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-15 18:16:24,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:24,666 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 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] [2022-04-15 18:16:24,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 18:16:24,666 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash -720045882, now seen corresponding path program 1 times [2022-04-15 18:16:24,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:24,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812010577] [2022-04-15 18:16:39,481 WARN L232 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:16:46,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -720045882, now seen corresponding path program 2 times [2022-04-15 18:16:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:46,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114180984] [2022-04-15 18:16:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:46,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:46,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {46579#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {46572#true} is VALID [2022-04-15 18:16:46,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {46572#true} assume true; {46572#true} is VALID [2022-04-15 18:16:46,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46572#true} {46572#true} #593#return; {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {46572#true} call ULTIMATE.init(); {46579#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {46579#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {46572#true} assume true; {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46572#true} {46572#true} #593#return; {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {46572#true} call #t~ret158 := main(); {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {46572#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {46572#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {46572#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {46572#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {46572#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {46572#true} is VALID [2022-04-15 18:16:46,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {46572#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {46572#true} assume !false; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {46572#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {46572#true} assume 12292 == #t~mem49;havoc #t~mem49; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {46572#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {46572#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {46572#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {46572#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {46572#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, 80 + ~s.offset, 8); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {46572#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {46572#true} assume !(0 == ~tmp___4~0); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {46572#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {46572#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {46572#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {46572#true} ~skip~0 := 0; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {46572#true} assume !false; {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {46572#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {46572#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {46572#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {46572#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {46572#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {46572#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {46572#true} assume 4368 == #t~mem54;havoc #t~mem54; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {46572#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {46572#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {46572#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {46572#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {46572#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {46572#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {46572#true} ~skip~0 := 0; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {46572#true} assume !false; {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {46572#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {46572#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {46572#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {46572#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {46572#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {46572#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {46572#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {46572#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {46572#true} assume 4384 == #t~mem56;havoc #t~mem56; {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {46572#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {46572#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {46572#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {46572#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {46572#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {46572#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {46572#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {46572#true} ~skip~0 := 0; {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {46572#true} assume !false; {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {46572#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {46572#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {46572#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {46572#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {46572#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {46572#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {46572#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {46572#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {46572#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {46572#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {46572#true} assume 4400 == #t~mem58;havoc #t~mem58; {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {46572#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 71: Hoare triple {46572#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {46572#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {46572#true} assume !(~ret~0 <= 0); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {46572#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {46572#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {46572#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {46572#true} ~skip~0 := 0; {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 78: Hoare triple {46572#true} assume !false; {46572#true} is VALID [2022-04-15 18:16:46,635 INFO L290 TraceCheckUtils]: 79: Hoare triple {46572#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 80: Hoare triple {46572#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 81: Hoare triple {46572#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 82: Hoare triple {46572#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 83: Hoare triple {46572#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 84: Hoare triple {46572#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {46572#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 86: Hoare triple {46572#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 87: Hoare triple {46572#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 88: Hoare triple {46572#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 89: Hoare triple {46572#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {46572#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 91: Hoare triple {46572#true} assume 4416 == #t~mem60;havoc #t~mem60; {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 92: Hoare triple {46572#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {46572#true} is VALID [2022-04-15 18:16:46,636 INFO L290 TraceCheckUtils]: 93: Hoare triple {46572#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {46572#true} is VALID [2022-04-15 18:16:46,637 INFO L290 TraceCheckUtils]: 94: Hoare triple {46572#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,637 INFO L290 TraceCheckUtils]: 95: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(0 == ~tmp___6~0); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,638 INFO L290 TraceCheckUtils]: 96: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,638 INFO L290 TraceCheckUtils]: 97: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,638 INFO L290 TraceCheckUtils]: 98: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} ~skip~0 := 0; {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,638 INFO L290 TraceCheckUtils]: 99: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !false; {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,639 INFO L290 TraceCheckUtils]: 102: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,639 INFO L290 TraceCheckUtils]: 103: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,640 INFO L290 TraceCheckUtils]: 104: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-15 18:16:46,640 INFO L290 TraceCheckUtils]: 105: Hoare triple {46577#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46578#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-15 18:16:46,640 INFO L290 TraceCheckUtils]: 106: Hoare triple {46578#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {46573#false} is VALID [2022-04-15 18:16:46,640 INFO L290 TraceCheckUtils]: 107: Hoare triple {46573#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {46573#false} is VALID [2022-04-15 18:16:46,640 INFO L290 TraceCheckUtils]: 108: Hoare triple {46573#false} assume !(0 == ~blastFlag~0); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 109: Hoare triple {46573#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 110: Hoare triple {46573#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 111: Hoare triple {46573#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 112: Hoare triple {46573#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 113: Hoare triple {46573#false} ~skip~0 := 0; {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 114: Hoare triple {46573#false} assume !false; {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 115: Hoare triple {46573#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 116: Hoare triple {46573#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 117: Hoare triple {46573#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 118: Hoare triple {46573#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 119: Hoare triple {46573#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 120: Hoare triple {46573#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 121: Hoare triple {46573#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 122: Hoare triple {46573#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 123: Hoare triple {46573#false} assume 4384 == #t~mem56;havoc #t~mem56; {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 124: Hoare triple {46573#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46573#false} is VALID [2022-04-15 18:16:46,641 INFO L290 TraceCheckUtils]: 125: Hoare triple {46573#false} assume !(1 == ~blastFlag~0); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 126: Hoare triple {46573#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 127: Hoare triple {46573#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 128: Hoare triple {46573#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 129: Hoare triple {46573#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 130: Hoare triple {46573#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 131: Hoare triple {46573#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 132: Hoare triple {46573#false} ~skip~0 := 0; {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 133: Hoare triple {46573#false} assume !false; {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 134: Hoare triple {46573#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 135: Hoare triple {46573#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 136: Hoare triple {46573#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 137: Hoare triple {46573#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 138: Hoare triple {46573#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 139: Hoare triple {46573#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 140: Hoare triple {46573#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,642 INFO L290 TraceCheckUtils]: 141: Hoare triple {46573#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 142: Hoare triple {46573#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 143: Hoare triple {46573#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 144: Hoare triple {46573#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 145: Hoare triple {46573#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 146: Hoare triple {46573#false} assume 4416 == #t~mem60;havoc #t~mem60; {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 147: Hoare triple {46573#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 148: Hoare triple {46573#false} assume !(3 == ~blastFlag~0); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 149: Hoare triple {46573#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 150: Hoare triple {46573#false} assume !(0 == ~tmp___6~0); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 151: Hoare triple {46573#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 152: Hoare triple {46573#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 153: Hoare triple {46573#false} ~skip~0 := 0; {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 154: Hoare triple {46573#false} assume !false; {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 155: Hoare triple {46573#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 156: Hoare triple {46573#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 157: Hoare triple {46573#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,643 INFO L290 TraceCheckUtils]: 158: Hoare triple {46573#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 159: Hoare triple {46573#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 160: Hoare triple {46573#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 161: Hoare triple {46573#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 162: Hoare triple {46573#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 163: Hoare triple {46573#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 164: Hoare triple {46573#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 165: Hoare triple {46573#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 166: Hoare triple {46573#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 167: Hoare triple {46573#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 168: Hoare triple {46573#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 169: Hoare triple {46573#false} assume 4432 == #t~mem62;havoc #t~mem62; {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 170: Hoare triple {46573#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 171: Hoare triple {46573#false} assume 5 == ~blastFlag~0; {46573#false} is VALID [2022-04-15 18:16:46,644 INFO L290 TraceCheckUtils]: 172: Hoare triple {46573#false} assume !false; {46573#false} is VALID [2022-04-15 18:16:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-04-15 18:16:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:46,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114180984] [2022-04-15 18:16:46,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114180984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:46,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:46,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:46,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:46,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812010577] [2022-04-15 18:16:46,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812010577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:46,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:46,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166844004] [2022-04-15 18:16:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:46,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 173 [2022-04-15 18:16:46,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:46,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:46,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:46,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:46,724 INFO L87 Difference]: Start difference. First operand 984 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:48,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:50,233 INFO L93 Difference]: Finished difference Result 2336 states and 3574 transitions. [2022-04-15 18:16:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 173 [2022-04-15 18:16:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:16:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:16:50,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:16:50,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:50,660 INFO L225 Difference]: With dead ends: 2336 [2022-04-15 18:16:50,660 INFO L226 Difference]: Without dead ends: 1516 [2022-04-15 18:16:50,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:50,662 INFO L913 BasicCegarLoop]: 205 mSDtfsCounter, 113 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:50,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 492 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 495 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:16:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2022-04-15 18:16:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1080. [2022-04-15 18:16:50,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:50,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1516 states. Second operand has 1080 states, 1075 states have (on average 1.5497674418604652) internal successors, (1666), 1075 states have internal predecessors, (1666), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,707 INFO L74 IsIncluded]: Start isIncluded. First operand 1516 states. Second operand has 1080 states, 1075 states have (on average 1.5497674418604652) internal successors, (1666), 1075 states have internal predecessors, (1666), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,708 INFO L87 Difference]: Start difference. First operand 1516 states. Second operand has 1080 states, 1075 states have (on average 1.5497674418604652) internal successors, (1666), 1075 states have internal predecessors, (1666), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:50,766 INFO L93 Difference]: Finished difference Result 1516 states and 2282 transitions. [2022-04-15 18:16:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2282 transitions. [2022-04-15 18:16:50,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:50,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:50,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.5497674418604652) internal successors, (1666), 1075 states have internal predecessors, (1666), 3 states have call successors, (3), 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 1516 states. [2022-04-15 18:16:50,770 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.5497674418604652) internal successors, (1666), 1075 states have internal predecessors, (1666), 3 states have call successors, (3), 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 1516 states. [2022-04-15 18:16:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:50,829 INFO L93 Difference]: Finished difference Result 1516 states and 2282 transitions. [2022-04-15 18:16:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2282 transitions. [2022-04-15 18:16:50,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:50,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:50,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:50,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.5497674418604652) internal successors, (1666), 1075 states have internal predecessors, (1666), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1670 transitions. [2022-04-15 18:16:50,880 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1670 transitions. Word has length 173 [2022-04-15 18:16:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:50,880 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1670 transitions. [2022-04-15 18:16:50,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1670 transitions. [2022-04-15 18:16:52,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1670 edges. 1670 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1670 transitions. [2022-04-15 18:16:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-15 18:16:52,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:52,285 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:52,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 18:16:52,285 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1514097495, now seen corresponding path program 1 times [2022-04-15 18:16:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:52,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1131303754] [2022-04-15 18:17:06,018 WARN L232 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:17:13,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1514097495, now seen corresponding path program 2 times [2022-04-15 18:17:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:13,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102100801] [2022-04-15 18:17:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:13,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {56455#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {56448#true} is VALID [2022-04-15 18:17:13,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {56448#true} assume true; {56448#true} is VALID [2022-04-15 18:17:13,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56448#true} {56448#true} #593#return; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {56448#true} call ULTIMATE.init(); {56455#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {56455#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {56448#true} assume true; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56448#true} {56448#true} #593#return; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {56448#true} call #t~ret158 := main(); {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {56448#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {56448#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {56448#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {56448#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {56448#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {56448#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {56448#true} assume !false; {56448#true} is VALID [2022-04-15 18:17:13,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {56448#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {56448#true} assume 12292 == #t~mem49;havoc #t~mem49; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {56448#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {56448#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {56448#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {56448#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {56448#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, 80 + ~s.offset, 8); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {56448#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {56448#true} assume !(0 == ~tmp___4~0); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {56448#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {56448#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {56448#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {56448#true} ~skip~0 := 0; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {56448#true} assume !false; {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {56448#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {56448#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {56448#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {56448#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {56448#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {56448#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {56448#true} assume 4368 == #t~mem54;havoc #t~mem54; {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {56448#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {56448#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {56448#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {56448#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {56448#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {56448#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {56448#true} ~skip~0 := 0; {56448#true} is VALID [2022-04-15 18:17:13,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {56448#true} assume !false; {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {56448#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {56448#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {56448#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {56448#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {56448#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {56448#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {56448#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {56448#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {56448#true} assume 4384 == #t~mem56;havoc #t~mem56; {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {56448#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {56448#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {56448#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {56448#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {56448#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {56448#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {56448#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56448#true} is VALID [2022-04-15 18:17:13,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {56448#true} ~skip~0 := 0; {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {56448#true} assume !false; {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {56448#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 60: Hoare triple {56448#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {56448#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {56448#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {56448#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {56448#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 65: Hoare triple {56448#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {56448#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {56448#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {56448#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {56448#true} assume 4400 == #t~mem58;havoc #t~mem58; {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {56448#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {56448#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 72: Hoare triple {56448#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 73: Hoare triple {56448#true} assume !(~ret~0 <= 0); {56448#true} is VALID [2022-04-15 18:17:13,625 INFO L290 TraceCheckUtils]: 74: Hoare triple {56448#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {56448#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 76: Hoare triple {56448#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 77: Hoare triple {56448#true} ~skip~0 := 0; {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 78: Hoare triple {56448#true} assume !false; {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 79: Hoare triple {56448#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {56448#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {56448#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {56448#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {56448#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {56448#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {56448#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {56448#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {56448#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {56448#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {56448#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {56448#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 91: Hoare triple {56448#true} assume 4416 == #t~mem60;havoc #t~mem60; {56448#true} is VALID [2022-04-15 18:17:13,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {56448#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {56448#true} is VALID [2022-04-15 18:17:13,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {56448#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {56448#true} is VALID [2022-04-15 18:17:13,628 INFO L290 TraceCheckUtils]: 94: Hoare triple {56448#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,628 INFO L290 TraceCheckUtils]: 96: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,629 INFO L290 TraceCheckUtils]: 98: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,629 INFO L290 TraceCheckUtils]: 100: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,630 INFO L290 TraceCheckUtils]: 102: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,631 INFO L290 TraceCheckUtils]: 104: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,631 INFO L290 TraceCheckUtils]: 105: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:17:13,631 INFO L290 TraceCheckUtils]: 106: Hoare triple {56453#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56454#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 107: Hoare triple {56454#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 108: Hoare triple {56449#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 109: Hoare triple {56449#false} assume !(0 == ~blastFlag~0); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 110: Hoare triple {56449#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 111: Hoare triple {56449#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 112: Hoare triple {56449#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 113: Hoare triple {56449#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 114: Hoare triple {56449#false} ~skip~0 := 0; {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 115: Hoare triple {56449#false} assume !false; {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 116: Hoare triple {56449#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 117: Hoare triple {56449#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 118: Hoare triple {56449#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 119: Hoare triple {56449#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 120: Hoare triple {56449#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,632 INFO L290 TraceCheckUtils]: 121: Hoare triple {56449#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 122: Hoare triple {56449#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 123: Hoare triple {56449#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 124: Hoare triple {56449#false} assume 4384 == #t~mem56;havoc #t~mem56; {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 125: Hoare triple {56449#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 126: Hoare triple {56449#false} assume !(1 == ~blastFlag~0); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 127: Hoare triple {56449#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {56449#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {56449#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 130: Hoare triple {56449#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 131: Hoare triple {56449#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 132: Hoare triple {56449#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 133: Hoare triple {56449#false} ~skip~0 := 0; {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 134: Hoare triple {56449#false} assume !false; {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 135: Hoare triple {56449#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 136: Hoare triple {56449#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 137: Hoare triple {56449#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {56449#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 139: Hoare triple {56449#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 140: Hoare triple {56449#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 141: Hoare triple {56449#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {56449#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 143: Hoare triple {56449#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {56449#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 145: Hoare triple {56449#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 146: Hoare triple {56449#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 147: Hoare triple {56449#false} assume 4416 == #t~mem60;havoc #t~mem60; {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 148: Hoare triple {56449#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 149: Hoare triple {56449#false} assume !(3 == ~blastFlag~0); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 150: Hoare triple {56449#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 151: Hoare triple {56449#false} assume !(0 == ~tmp___6~0); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 152: Hoare triple {56449#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 153: Hoare triple {56449#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 154: Hoare triple {56449#false} ~skip~0 := 0; {56449#false} is VALID [2022-04-15 18:17:13,634 INFO L290 TraceCheckUtils]: 155: Hoare triple {56449#false} assume !false; {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 156: Hoare triple {56449#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 157: Hoare triple {56449#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 158: Hoare triple {56449#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 159: Hoare triple {56449#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 160: Hoare triple {56449#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 161: Hoare triple {56449#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 162: Hoare triple {56449#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 163: Hoare triple {56449#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 164: Hoare triple {56449#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 165: Hoare triple {56449#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 166: Hoare triple {56449#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 167: Hoare triple {56449#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 168: Hoare triple {56449#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 169: Hoare triple {56449#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 170: Hoare triple {56449#false} assume 4432 == #t~mem62;havoc #t~mem62; {56449#false} is VALID [2022-04-15 18:17:13,635 INFO L290 TraceCheckUtils]: 171: Hoare triple {56449#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {56449#false} is VALID [2022-04-15 18:17:13,636 INFO L290 TraceCheckUtils]: 172: Hoare triple {56449#false} assume 5 == ~blastFlag~0; {56449#false} is VALID [2022-04-15 18:17:13,636 INFO L290 TraceCheckUtils]: 173: Hoare triple {56449#false} assume !false; {56449#false} is VALID [2022-04-15 18:17:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-04-15 18:17:13,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102100801] [2022-04-15 18:17:13,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102100801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:13,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:13,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:13,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:13,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1131303754] [2022-04-15 18:17:13,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1131303754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:13,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:13,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720061587] [2022-04-15 18:17:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 174 [2022-04-15 18:17:13,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:13,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:13,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:13,713 INFO L87 Difference]: Start difference. First operand 1080 states and 1670 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:15,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,280 INFO L93 Difference]: Finished difference Result 2278 states and 3482 transitions. [2022-04-15 18:17:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:17,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 174 [2022-04-15 18:17:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-15 18:17:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-15 18:17:17,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-04-15 18:17:17,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:17,662 INFO L225 Difference]: With dead ends: 2278 [2022-04-15 18:17:17,662 INFO L226 Difference]: Without dead ends: 1378 [2022-04-15 18:17:17,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:17,664 INFO L913 BasicCegarLoop]: 229 mSDtfsCounter, 92 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:17,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 547 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 514 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:17:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2022-04-15 18:17:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1080. [2022-04-15 18:17:17,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:17,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1378 states. Second operand has 1080 states, 1075 states have (on average 1.5451162790697675) internal successors, (1661), 1075 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,723 INFO L74 IsIncluded]: Start isIncluded. First operand 1378 states. Second operand has 1080 states, 1075 states have (on average 1.5451162790697675) internal successors, (1661), 1075 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,724 INFO L87 Difference]: Start difference. First operand 1378 states. Second operand has 1080 states, 1075 states have (on average 1.5451162790697675) internal successors, (1661), 1075 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,774 INFO L93 Difference]: Finished difference Result 1378 states and 2080 transitions. [2022-04-15 18:17:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2080 transitions. [2022-04-15 18:17:17,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:17,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:17,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.5451162790697675) internal successors, (1661), 1075 states have internal predecessors, (1661), 3 states have call successors, (3), 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 1378 states. [2022-04-15 18:17:17,779 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.5451162790697675) internal successors, (1661), 1075 states have internal predecessors, (1661), 3 states have call successors, (3), 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 1378 states. [2022-04-15 18:17:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,831 INFO L93 Difference]: Finished difference Result 1378 states and 2080 transitions. [2022-04-15 18:17:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2080 transitions. [2022-04-15 18:17:17,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:17,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:17,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:17,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.5451162790697675) internal successors, (1661), 1075 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1665 transitions. [2022-04-15 18:17:17,880 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1665 transitions. Word has length 174 [2022-04-15 18:17:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:17,881 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1665 transitions. [2022-04-15 18:17:17,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1665 transitions. [2022-04-15 18:17:19,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1665 transitions. [2022-04-15 18:17:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-15 18:17:19,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:19,217 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:19,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:17:19,217 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1662645906, now seen corresponding path program 3 times [2022-04-15 18:17:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:19,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1968419538] [2022-04-15 18:17:30,661 WARN L232 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:17:39,095 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1662645906, now seen corresponding path program 4 times [2022-04-15 18:17:39,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:39,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284139877] [2022-04-15 18:17:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:39,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {65939#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {65932#true} is VALID [2022-04-15 18:17:39,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {65932#true} assume true; {65932#true} is VALID [2022-04-15 18:17:39,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65932#true} {65932#true} #593#return; {65932#true} is VALID [2022-04-15 18:17:39,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {65932#true} call ULTIMATE.init(); {65939#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:39,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {65939#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {65932#true} is VALID [2022-04-15 18:17:39,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {65932#true} assume true; {65932#true} is VALID [2022-04-15 18:17:39,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65932#true} {65932#true} #593#return; {65932#true} is VALID [2022-04-15 18:17:39,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {65932#true} call #t~ret158 := main(); {65932#true} is VALID [2022-04-15 18:17:39,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {65932#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {65932#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {65932#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {65932#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {65932#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {65932#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {65932#true} assume !false; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {65932#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {65932#true} assume 12292 == #t~mem49;havoc #t~mem49; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {65932#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {65932#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {65932#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {65932#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {65932#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, 80 + ~s.offset, 8); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {65932#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {65932#true} assume !(0 == ~tmp___4~0); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {65932#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {65932#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {65932#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {65932#true} ~skip~0 := 0; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {65932#true} assume !false; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {65932#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {65932#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {65932#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {65932#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {65932#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {65932#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {65932#true} assume 4368 == #t~mem54;havoc #t~mem54; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {65932#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {65932#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {65932#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {65932#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {65932#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {65932#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {65932#true} ~skip~0 := 0; {65932#true} is VALID [2022-04-15 18:17:39,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {65932#true} assume !false; {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {65932#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {65932#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {65932#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {65932#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {65932#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {65932#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {65932#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {65932#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {65932#true} assume 4384 == #t~mem56;havoc #t~mem56; {65932#true} is VALID [2022-04-15 18:17:39,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {65932#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {65932#true} is VALID [2022-04-15 18:17:39,313 INFO L290 TraceCheckUtils]: 51: Hoare triple {65932#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {65932#true} is VALID [2022-04-15 18:17:39,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {65932#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {65932#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {65932#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {65932#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {65932#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {65932#true} ~skip~0 := 0; {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {65932#true} assume !false; {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {65932#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {65932#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {65932#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {65932#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {65932#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {65932#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {65932#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {65932#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {65932#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {65932#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {65932#true} assume 4400 == #t~mem58;havoc #t~mem58; {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {65932#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {65932#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {65932#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {65932#true} assume !(~ret~0 <= 0); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 74: Hoare triple {65932#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {65932#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {65932#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {65932#true} ~skip~0 := 0; {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 78: Hoare triple {65932#true} assume !false; {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {65932#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 80: Hoare triple {65932#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 81: Hoare triple {65932#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {65932#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 83: Hoare triple {65932#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {65932#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 85: Hoare triple {65932#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,315 INFO L290 TraceCheckUtils]: 86: Hoare triple {65932#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {65932#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {65932#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 89: Hoare triple {65932#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 90: Hoare triple {65932#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 91: Hoare triple {65932#true} assume 4416 == #t~mem60;havoc #t~mem60; {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 92: Hoare triple {65932#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {65932#true} is VALID [2022-04-15 18:17:39,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {65932#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {65932#true} is VALID [2022-04-15 18:17:39,317 INFO L290 TraceCheckUtils]: 94: Hoare triple {65932#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:39,318 INFO L290 TraceCheckUtils]: 95: Hoare triple {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:39,318 INFO L290 TraceCheckUtils]: 96: Hoare triple {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:39,318 INFO L290 TraceCheckUtils]: 97: Hoare triple {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:39,319 INFO L290 TraceCheckUtils]: 98: Hoare triple {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:39,319 INFO L290 TraceCheckUtils]: 99: Hoare triple {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:17:39,319 INFO L290 TraceCheckUtils]: 100: Hoare triple {65937#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65938#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-15 18:17:39,319 INFO L290 TraceCheckUtils]: 101: Hoare triple {65938#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {65933#false} is VALID [2022-04-15 18:17:39,319 INFO L290 TraceCheckUtils]: 102: Hoare triple {65933#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {65933#false} is VALID [2022-04-15 18:17:39,319 INFO L290 TraceCheckUtils]: 103: Hoare triple {65933#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,320 INFO L290 TraceCheckUtils]: 104: Hoare triple {65933#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {65933#false} is VALID [2022-04-15 18:17:39,320 INFO L290 TraceCheckUtils]: 105: Hoare triple {65933#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {65933#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, 80 + ~s.offset, 8); {65933#false} is VALID [2022-04-15 18:17:39,332 INFO L290 TraceCheckUtils]: 107: Hoare triple {65933#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {65933#false} is VALID [2022-04-15 18:17:39,332 INFO L290 TraceCheckUtils]: 108: Hoare triple {65933#false} assume !(0 == ~tmp___4~0); {65933#false} is VALID [2022-04-15 18:17:39,332 INFO L290 TraceCheckUtils]: 109: Hoare triple {65933#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,332 INFO L290 TraceCheckUtils]: 110: Hoare triple {65933#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,332 INFO L290 TraceCheckUtils]: 111: Hoare triple {65933#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65933#false} is VALID [2022-04-15 18:17:39,332 INFO L290 TraceCheckUtils]: 112: Hoare triple {65933#false} ~skip~0 := 0; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 113: Hoare triple {65933#false} assume !false; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 114: Hoare triple {65933#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 115: Hoare triple {65933#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {65933#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {65933#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 118: Hoare triple {65933#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 119: Hoare triple {65933#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 120: Hoare triple {65933#false} assume 4368 == #t~mem54;havoc #t~mem54; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 121: Hoare triple {65933#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 122: Hoare triple {65933#false} assume !(0 == ~blastFlag~0); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 123: Hoare triple {65933#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 124: Hoare triple {65933#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 125: Hoare triple {65933#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 126: Hoare triple {65933#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 127: Hoare triple {65933#false} ~skip~0 := 0; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 128: Hoare triple {65933#false} assume !false; {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 129: Hoare triple {65933#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,333 INFO L290 TraceCheckUtils]: 130: Hoare triple {65933#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 131: Hoare triple {65933#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 132: Hoare triple {65933#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 133: Hoare triple {65933#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {65933#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 135: Hoare triple {65933#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 136: Hoare triple {65933#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 137: Hoare triple {65933#false} assume 4384 == #t~mem56;havoc #t~mem56; {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 138: Hoare triple {65933#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 139: Hoare triple {65933#false} assume !(1 == ~blastFlag~0); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 140: Hoare triple {65933#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 141: Hoare triple {65933#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 142: Hoare triple {65933#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 143: Hoare triple {65933#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 144: Hoare triple {65933#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 145: Hoare triple {65933#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65933#false} is VALID [2022-04-15 18:17:39,334 INFO L290 TraceCheckUtils]: 146: Hoare triple {65933#false} ~skip~0 := 0; {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 147: Hoare triple {65933#false} assume !false; {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 148: Hoare triple {65933#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 149: Hoare triple {65933#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 150: Hoare triple {65933#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 151: Hoare triple {65933#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 152: Hoare triple {65933#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 153: Hoare triple {65933#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 154: Hoare triple {65933#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 155: Hoare triple {65933#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 156: Hoare triple {65933#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 157: Hoare triple {65933#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 158: Hoare triple {65933#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 159: Hoare triple {65933#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 160: Hoare triple {65933#false} assume 4416 == #t~mem60;havoc #t~mem60; {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 161: Hoare triple {65933#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {65933#false} is VALID [2022-04-15 18:17:39,335 INFO L290 TraceCheckUtils]: 162: Hoare triple {65933#false} assume !(3 == ~blastFlag~0); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 163: Hoare triple {65933#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 164: Hoare triple {65933#false} assume !(0 == ~tmp___6~0); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 165: Hoare triple {65933#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 166: Hoare triple {65933#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 167: Hoare triple {65933#false} ~skip~0 := 0; {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 168: Hoare triple {65933#false} assume !false; {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 169: Hoare triple {65933#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 170: Hoare triple {65933#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 171: Hoare triple {65933#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 172: Hoare triple {65933#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 173: Hoare triple {65933#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 174: Hoare triple {65933#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 175: Hoare triple {65933#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 176: Hoare triple {65933#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 177: Hoare triple {65933#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 178: Hoare triple {65933#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 179: Hoare triple {65933#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,336 INFO L290 TraceCheckUtils]: 180: Hoare triple {65933#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L290 TraceCheckUtils]: 181: Hoare triple {65933#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L290 TraceCheckUtils]: 182: Hoare triple {65933#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L290 TraceCheckUtils]: 183: Hoare triple {65933#false} assume 4432 == #t~mem62;havoc #t~mem62; {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L290 TraceCheckUtils]: 184: Hoare triple {65933#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L290 TraceCheckUtils]: 185: Hoare triple {65933#false} assume 5 == ~blastFlag~0; {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L290 TraceCheckUtils]: 186: Hoare triple {65933#false} assume !false; {65933#false} is VALID [2022-04-15 18:17:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 18:17:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:39,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284139877] [2022-04-15 18:17:39,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284139877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:39,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:39,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:39,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:39,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1968419538] [2022-04-15 18:17:39,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1968419538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:39,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:39,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936778386] [2022-04-15 18:17:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:39,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 187 [2022-04-15 18:17:39,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:39,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:39,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:39,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:39,426 INFO L87 Difference]: Start difference. First operand 1080 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:41,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:42,697 INFO L93 Difference]: Finished difference Result 2520 states and 3832 transitions. [2022-04-15 18:17:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 187 [2022-04-15 18:17:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:17:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:17:42,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 18:17:43,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:43,099 INFO L225 Difference]: With dead ends: 2520 [2022-04-15 18:17:43,100 INFO L226 Difference]: Without dead ends: 1456 [2022-04-15 18:17:43,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:43,102 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 110 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:43,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 300 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:17:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-04-15 18:17:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1080. [2022-04-15 18:17:43,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:43,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1456 states. Second operand has 1080 states, 1075 states have (on average 1.5246511627906976) internal successors, (1639), 1075 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:43,153 INFO L74 IsIncluded]: Start isIncluded. First operand 1456 states. Second operand has 1080 states, 1075 states have (on average 1.5246511627906976) internal successors, (1639), 1075 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:43,153 INFO L87 Difference]: Start difference. First operand 1456 states. Second operand has 1080 states, 1075 states have (on average 1.5246511627906976) internal successors, (1639), 1075 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:43,207 INFO L93 Difference]: Finished difference Result 1456 states and 2165 transitions. [2022-04-15 18:17:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2165 transitions. [2022-04-15 18:17:43,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:43,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:43,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.5246511627906976) internal successors, (1639), 1075 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1456 states. [2022-04-15 18:17:43,211 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.5246511627906976) internal successors, (1639), 1075 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1456 states. [2022-04-15 18:17:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:43,266 INFO L93 Difference]: Finished difference Result 1456 states and 2165 transitions. [2022-04-15 18:17:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2165 transitions. [2022-04-15 18:17:43,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:43,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:43,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:43,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.5246511627906976) internal successors, (1639), 1075 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1643 transitions. [2022-04-15 18:17:43,339 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1643 transitions. Word has length 187 [2022-04-15 18:17:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:43,339 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1643 transitions. [2022-04-15 18:17:43,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:43,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1643 transitions. [2022-04-15 18:17:44,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1643 edges. 1643 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1643 transitions. [2022-04-15 18:17:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-15 18:17:44,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:44,794 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:44,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:17:44,794 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash 878976524, now seen corresponding path program 1 times [2022-04-15 18:17:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:44,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134475388] [2022-04-15 18:18:00,854 WARN L232 SmtUtils]: Spent 9.82s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:18:07,318 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:18:07,319 INFO L85 PathProgramCache]: Analyzing trace with hash 878976524, now seen corresponding path program 2 times [2022-04-15 18:18:07,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:18:07,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826683840] [2022-04-15 18:18:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:18:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:18:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:18:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:07,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {76063#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {76056#true} is VALID [2022-04-15 18:18:07,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {76056#true} assume true; {76056#true} is VALID [2022-04-15 18:18:07,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76056#true} {76056#true} #593#return; {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {76056#true} call ULTIMATE.init(); {76063#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {76063#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {76056#true} assume true; {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76056#true} {76056#true} #593#return; {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {76056#true} call #t~ret158 := main(); {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {76056#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {76056#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {76056#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {76056#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {76056#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {76056#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {76056#true} is VALID [2022-04-15 18:18:07,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {76056#true} assume !false; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {76056#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {76056#true} assume 12292 == #t~mem49;havoc #t~mem49; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {76056#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {76056#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {76056#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {76056#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {76056#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, 80 + ~s.offset, 8); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {76056#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {76056#true} assume !(0 == ~tmp___4~0); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {76056#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {76056#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {76056#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {76056#true} ~skip~0 := 0; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {76056#true} assume !false; {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {76056#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {76056#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {76056#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {76056#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {76056#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {76056#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {76056#true} assume 4368 == #t~mem54;havoc #t~mem54; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {76056#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {76056#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {76056#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {76056#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {76056#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {76056#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {76056#true} ~skip~0 := 0; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {76056#true} assume !false; {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {76056#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {76056#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {76056#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {76056#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {76056#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {76056#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {76056#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {76056#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {76056#true} assume 4384 == #t~mem56;havoc #t~mem56; {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {76056#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {76056#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {76056#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {76056#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {76056#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {76056#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {76056#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {76056#true} ~skip~0 := 0; {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {76056#true} assume !false; {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {76056#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {76056#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {76056#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {76056#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {76056#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {76056#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {76056#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {76056#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {76056#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {76056#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {76056#true} assume 4400 == #t~mem58;havoc #t~mem58; {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {76056#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {76056#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {76056#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 73: Hoare triple {76056#true} assume !(~ret~0 <= 0); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 74: Hoare triple {76056#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {76056#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {76056#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {76056#true} ~skip~0 := 0; {76056#true} is VALID [2022-04-15 18:18:07,529 INFO L290 TraceCheckUtils]: 78: Hoare triple {76056#true} assume !false; {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 79: Hoare triple {76056#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {76056#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 81: Hoare triple {76056#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 82: Hoare triple {76056#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 83: Hoare triple {76056#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 84: Hoare triple {76056#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {76056#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {76056#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {76056#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {76056#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 89: Hoare triple {76056#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {76056#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 91: Hoare triple {76056#true} assume 4416 == #t~mem60;havoc #t~mem60; {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 92: Hoare triple {76056#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {76056#true} is VALID [2022-04-15 18:18:07,530 INFO L290 TraceCheckUtils]: 93: Hoare triple {76056#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {76056#true} is VALID [2022-04-15 18:18:07,531 INFO L290 TraceCheckUtils]: 94: Hoare triple {76056#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,531 INFO L290 TraceCheckUtils]: 95: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(0 == ~tmp___6~0); {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,532 INFO L290 TraceCheckUtils]: 96: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,532 INFO L290 TraceCheckUtils]: 97: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,532 INFO L290 TraceCheckUtils]: 98: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} ~skip~0 := 0; {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,532 INFO L290 TraceCheckUtils]: 99: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !false; {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 100: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 101: Hoare triple {76061#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76062#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 102: Hoare triple {76062#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {76057#false} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 103: Hoare triple {76057#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 104: Hoare triple {76057#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {76057#false} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 105: Hoare triple {76057#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 106: Hoare triple {76057#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, 80 + ~s.offset, 8); {76057#false} is VALID [2022-04-15 18:18:07,533 INFO L290 TraceCheckUtils]: 107: Hoare triple {76057#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {76057#false} assume !(0 == ~tmp___4~0); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 109: Hoare triple {76057#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 110: Hoare triple {76057#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 111: Hoare triple {76057#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 112: Hoare triple {76057#false} ~skip~0 := 0; {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 113: Hoare triple {76057#false} assume !false; {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 114: Hoare triple {76057#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 115: Hoare triple {76057#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 116: Hoare triple {76057#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 117: Hoare triple {76057#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 118: Hoare triple {76057#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 119: Hoare triple {76057#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 120: Hoare triple {76057#false} assume 4368 == #t~mem54;havoc #t~mem54; {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 121: Hoare triple {76057#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 122: Hoare triple {76057#false} assume !(0 == ~blastFlag~0); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 123: Hoare triple {76057#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {76057#false} is VALID [2022-04-15 18:18:07,534 INFO L290 TraceCheckUtils]: 124: Hoare triple {76057#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 125: Hoare triple {76057#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {76057#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 127: Hoare triple {76057#false} ~skip~0 := 0; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 128: Hoare triple {76057#false} assume !false; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 129: Hoare triple {76057#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 130: Hoare triple {76057#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 131: Hoare triple {76057#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 132: Hoare triple {76057#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 133: Hoare triple {76057#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 134: Hoare triple {76057#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 135: Hoare triple {76057#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 136: Hoare triple {76057#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 137: Hoare triple {76057#false} assume 4384 == #t~mem56;havoc #t~mem56; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 138: Hoare triple {76057#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 139: Hoare triple {76057#false} assume !(1 == ~blastFlag~0); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 140: Hoare triple {76057#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 141: Hoare triple {76057#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,535 INFO L290 TraceCheckUtils]: 142: Hoare triple {76057#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 143: Hoare triple {76057#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 144: Hoare triple {76057#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {76057#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 146: Hoare triple {76057#false} ~skip~0 := 0; {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 147: Hoare triple {76057#false} assume !false; {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 148: Hoare triple {76057#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 149: Hoare triple {76057#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 150: Hoare triple {76057#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 151: Hoare triple {76057#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 152: Hoare triple {76057#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 153: Hoare triple {76057#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 154: Hoare triple {76057#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 155: Hoare triple {76057#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 156: Hoare triple {76057#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 157: Hoare triple {76057#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 158: Hoare triple {76057#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,536 INFO L290 TraceCheckUtils]: 159: Hoare triple {76057#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 160: Hoare triple {76057#false} assume 4416 == #t~mem60;havoc #t~mem60; {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 161: Hoare triple {76057#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 162: Hoare triple {76057#false} assume !(3 == ~blastFlag~0); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 163: Hoare triple {76057#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 164: Hoare triple {76057#false} assume !(0 == ~tmp___6~0); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 165: Hoare triple {76057#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 166: Hoare triple {76057#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 167: Hoare triple {76057#false} ~skip~0 := 0; {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 168: Hoare triple {76057#false} assume !false; {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 169: Hoare triple {76057#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 170: Hoare triple {76057#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 171: Hoare triple {76057#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 172: Hoare triple {76057#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 173: Hoare triple {76057#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 174: Hoare triple {76057#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,537 INFO L290 TraceCheckUtils]: 175: Hoare triple {76057#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 176: Hoare triple {76057#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 177: Hoare triple {76057#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 178: Hoare triple {76057#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 179: Hoare triple {76057#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 180: Hoare triple {76057#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 181: Hoare triple {76057#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 182: Hoare triple {76057#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 183: Hoare triple {76057#false} assume 4432 == #t~mem62;havoc #t~mem62; {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 184: Hoare triple {76057#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 185: Hoare triple {76057#false} assume 5 == ~blastFlag~0; {76057#false} is VALID [2022-04-15 18:18:07,538 INFO L290 TraceCheckUtils]: 186: Hoare triple {76057#false} assume !false; {76057#false} is VALID [2022-04-15 18:18:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 18:18:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:18:07,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826683840] [2022-04-15 18:18:07,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826683840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:07,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:07,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:07,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:18:07,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134475388] [2022-04-15 18:18:07,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134475388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:07,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:07,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844046678] [2022-04-15 18:18:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:18:07,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 187 [2022-04-15 18:18:07,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:18:07,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:07,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:07,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:18:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:07,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:18:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:18:07,620 INFO L87 Difference]: Start difference. First operand 1080 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:09,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:10,894 INFO L93 Difference]: Finished difference Result 2521 states and 3789 transitions. [2022-04-15 18:18:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:18:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 187 [2022-04-15 18:18:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:18:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:18:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:18:10,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:18:11,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:11,255 INFO L225 Difference]: With dead ends: 2521 [2022-04-15 18:18:11,255 INFO L226 Difference]: Without dead ends: 1457 [2022-04-15 18:18:11,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:18:11,258 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 117 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:18:11,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 282 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:18:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-04-15 18:18:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1080. [2022-04-15 18:18:11,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:18:11,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1457 states. Second operand has 1080 states, 1075 states have (on average 1.504186046511628) internal successors, (1617), 1075 states have internal predecessors, (1617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:11,326 INFO L74 IsIncluded]: Start isIncluded. First operand 1457 states. Second operand has 1080 states, 1075 states have (on average 1.504186046511628) internal successors, (1617), 1075 states have internal predecessors, (1617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:11,327 INFO L87 Difference]: Start difference. First operand 1457 states. Second operand has 1080 states, 1075 states have (on average 1.504186046511628) internal successors, (1617), 1075 states have internal predecessors, (1617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:11,381 INFO L93 Difference]: Finished difference Result 1457 states and 2144 transitions. [2022-04-15 18:18:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2144 transitions. [2022-04-15 18:18:11,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:11,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:11,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.504186046511628) internal successors, (1617), 1075 states have internal predecessors, (1617), 3 states have call successors, (3), 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 1457 states. [2022-04-15 18:18:11,385 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.504186046511628) internal successors, (1617), 1075 states have internal predecessors, (1617), 3 states have call successors, (3), 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 1457 states. [2022-04-15 18:18:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:11,439 INFO L93 Difference]: Finished difference Result 1457 states and 2144 transitions. [2022-04-15 18:18:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2144 transitions. [2022-04-15 18:18:11,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:11,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:11,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:18:11,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:18:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.504186046511628) internal successors, (1617), 1075 states have internal predecessors, (1617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1621 transitions. [2022-04-15 18:18:11,487 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1621 transitions. Word has length 187 [2022-04-15 18:18:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:18:11,487 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1621 transitions. [2022-04-15 18:18:11,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:11,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1621 transitions. [2022-04-15 18:18:13,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1621 edges. 1621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1621 transitions. [2022-04-15 18:18:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-15 18:18:13,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:18:13,006 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:18:13,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:18:13,006 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:18:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:18:13,006 INFO L85 PathProgramCache]: Analyzing trace with hash -121768081, now seen corresponding path program 1 times [2022-04-15 18:18:13,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:13,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203325740] [2022-04-15 18:18:22,267 WARN L232 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:18:33,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:18:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -121768081, now seen corresponding path program 2 times [2022-04-15 18:18:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:18:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139504593] [2022-04-15 18:18:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:18:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:18:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:18:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:34,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {86191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {86184#true} is VALID [2022-04-15 18:18:34,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {86184#true} assume true; {86184#true} is VALID [2022-04-15 18:18:34,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86184#true} {86184#true} #593#return; {86184#true} is VALID [2022-04-15 18:18:34,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {86184#true} call ULTIMATE.init(); {86191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {86191#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {86184#true} assume true; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86184#true} {86184#true} #593#return; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {86184#true} call #t~ret158 := main(); {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {86184#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L272 TraceCheckUtils]: 6: Hoare triple {86184#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {86184#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {86184#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {86184#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {86184#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {86184#true} assume !false; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {86184#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {86184#true} assume 12292 == #t~mem49;havoc #t~mem49; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {86184#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {86184#true} is VALID [2022-04-15 18:18:34,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {86184#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {86184#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {86184#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {86184#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, 80 + ~s.offset, 8); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {86184#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {86184#true} assume !(0 == ~tmp___4~0); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {86184#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {86184#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {86184#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {86184#true} ~skip~0 := 0; {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {86184#true} assume !false; {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {86184#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {86184#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {86184#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {86184#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {86184#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {86184#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {86184#true} assume 4368 == #t~mem54;havoc #t~mem54; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {86184#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {86184#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {86184#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {86184#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {86184#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {86184#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {86184#true} ~skip~0 := 0; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {86184#true} assume !false; {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {86184#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {86184#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {86184#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {86184#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {86184#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {86184#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {86184#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {86184#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {86184#true} assume 4384 == #t~mem56;havoc #t~mem56; {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {86184#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {86184#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {86184#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {86184#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {86184#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {86184#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {86184#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {86184#true} ~skip~0 := 0; {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {86184#true} assume !false; {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {86184#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {86184#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {86184#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {86184#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {86184#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {86184#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,174 INFO L290 TraceCheckUtils]: 65: Hoare triple {86184#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {86184#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 67: Hoare triple {86184#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 68: Hoare triple {86184#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 69: Hoare triple {86184#true} assume 4400 == #t~mem58;havoc #t~mem58; {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 70: Hoare triple {86184#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {86184#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {86184#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {86184#true} assume !(~ret~0 <= 0); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {86184#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 75: Hoare triple {86184#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 76: Hoare triple {86184#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 77: Hoare triple {86184#true} ~skip~0 := 0; {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 78: Hoare triple {86184#true} assume !false; {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 79: Hoare triple {86184#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 80: Hoare triple {86184#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 81: Hoare triple {86184#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,175 INFO L290 TraceCheckUtils]: 82: Hoare triple {86184#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {86184#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {86184#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {86184#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {86184#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {86184#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {86184#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {86184#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {86184#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 91: Hoare triple {86184#true} assume 4416 == #t~mem60;havoc #t~mem60; {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {86184#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {86184#true} is VALID [2022-04-15 18:18:34,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {86184#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86184#true} is VALID [2022-04-15 18:18:34,177 INFO L290 TraceCheckUtils]: 94: Hoare triple {86184#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,177 INFO L290 TraceCheckUtils]: 95: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,178 INFO L290 TraceCheckUtils]: 98: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,178 INFO L290 TraceCheckUtils]: 99: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,179 INFO L290 TraceCheckUtils]: 100: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,179 INFO L290 TraceCheckUtils]: 101: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:18:34,179 INFO L290 TraceCheckUtils]: 102: Hoare triple {86189#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86190#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 103: Hoare triple {86190#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 104: Hoare triple {86185#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 105: Hoare triple {86185#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 106: Hoare triple {86185#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 107: Hoare triple {86185#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, 80 + ~s.offset, 8); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 108: Hoare triple {86185#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 109: Hoare triple {86185#false} assume !(0 == ~tmp___4~0); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 110: Hoare triple {86185#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 111: Hoare triple {86185#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 112: Hoare triple {86185#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 113: Hoare triple {86185#false} ~skip~0 := 0; {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 114: Hoare triple {86185#false} assume !false; {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 115: Hoare triple {86185#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {86185#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 117: Hoare triple {86185#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 118: Hoare triple {86185#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 119: Hoare triple {86185#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 120: Hoare triple {86185#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 121: Hoare triple {86185#false} assume 4368 == #t~mem54;havoc #t~mem54; {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 122: Hoare triple {86185#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 123: Hoare triple {86185#false} assume !(0 == ~blastFlag~0); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 124: Hoare triple {86185#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 125: Hoare triple {86185#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 126: Hoare triple {86185#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 127: Hoare triple {86185#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 128: Hoare triple {86185#false} ~skip~0 := 0; {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 129: Hoare triple {86185#false} assume !false; {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 130: Hoare triple {86185#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 131: Hoare triple {86185#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 132: Hoare triple {86185#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,181 INFO L290 TraceCheckUtils]: 133: Hoare triple {86185#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 134: Hoare triple {86185#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 135: Hoare triple {86185#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 136: Hoare triple {86185#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 137: Hoare triple {86185#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 138: Hoare triple {86185#false} assume 4384 == #t~mem56;havoc #t~mem56; {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 139: Hoare triple {86185#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {86185#false} assume !(1 == ~blastFlag~0); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 141: Hoare triple {86185#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 142: Hoare triple {86185#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 143: Hoare triple {86185#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 144: Hoare triple {86185#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 145: Hoare triple {86185#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 146: Hoare triple {86185#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 147: Hoare triple {86185#false} ~skip~0 := 0; {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 148: Hoare triple {86185#false} assume !false; {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 149: Hoare triple {86185#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,182 INFO L290 TraceCheckUtils]: 150: Hoare triple {86185#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 151: Hoare triple {86185#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 152: Hoare triple {86185#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 153: Hoare triple {86185#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 154: Hoare triple {86185#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 155: Hoare triple {86185#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 156: Hoare triple {86185#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 157: Hoare triple {86185#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 158: Hoare triple {86185#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 159: Hoare triple {86185#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 160: Hoare triple {86185#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 161: Hoare triple {86185#false} assume 4416 == #t~mem60;havoc #t~mem60; {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 162: Hoare triple {86185#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 163: Hoare triple {86185#false} assume !(3 == ~blastFlag~0); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 164: Hoare triple {86185#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 165: Hoare triple {86185#false} assume !(0 == ~tmp___6~0); {86185#false} is VALID [2022-04-15 18:18:34,183 INFO L290 TraceCheckUtils]: 166: Hoare triple {86185#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 167: Hoare triple {86185#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 168: Hoare triple {86185#false} ~skip~0 := 0; {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 169: Hoare triple {86185#false} assume !false; {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 170: Hoare triple {86185#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 171: Hoare triple {86185#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 172: Hoare triple {86185#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 173: Hoare triple {86185#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 174: Hoare triple {86185#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 175: Hoare triple {86185#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 176: Hoare triple {86185#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 177: Hoare triple {86185#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 178: Hoare triple {86185#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 179: Hoare triple {86185#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 180: Hoare triple {86185#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 181: Hoare triple {86185#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 182: Hoare triple {86185#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 183: Hoare triple {86185#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {86185#false} is VALID [2022-04-15 18:18:34,184 INFO L290 TraceCheckUtils]: 184: Hoare triple {86185#false} assume 4432 == #t~mem62;havoc #t~mem62; {86185#false} is VALID [2022-04-15 18:18:34,185 INFO L290 TraceCheckUtils]: 185: Hoare triple {86185#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {86185#false} is VALID [2022-04-15 18:18:34,185 INFO L290 TraceCheckUtils]: 186: Hoare triple {86185#false} assume 5 == ~blastFlag~0; {86185#false} is VALID [2022-04-15 18:18:34,185 INFO L290 TraceCheckUtils]: 187: Hoare triple {86185#false} assume !false; {86185#false} is VALID [2022-04-15 18:18:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 18:18:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:18:34,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139504593] [2022-04-15 18:18:34,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139504593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:34,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:34,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:34,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:18:34,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203325740] [2022-04-15 18:18:34,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203325740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:34,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:34,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:18:34,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745792005] [2022-04-15 18:18:34,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:18:34,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 188 [2022-04-15 18:18:34,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:18:34,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:34,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:34,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:18:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:18:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:18:34,261 INFO L87 Difference]: Start difference. First operand 1080 states and 1621 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:39,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:41,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:43,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:44,818 INFO L93 Difference]: Finished difference Result 2437 states and 3632 transitions. [2022-04-15 18:18:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:18:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 188 [2022-04-15 18:18:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:18:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-15 18:18:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-15 18:18:44,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-15 18:18:45,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:45,149 INFO L225 Difference]: With dead ends: 2437 [2022-04-15 18:18:45,150 INFO L226 Difference]: Without dead ends: 1373 [2022-04-15 18:18:45,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:18:45,151 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 93 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:18:45,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 541 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-15 18:18:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-04-15 18:18:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1080. [2022-04-15 18:18:45,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:18:45,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1373 states. Second operand has 1080 states, 1075 states have (on average 1.4995348837209301) internal successors, (1612), 1075 states have internal predecessors, (1612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:45,217 INFO L74 IsIncluded]: Start isIncluded. First operand 1373 states. Second operand has 1080 states, 1075 states have (on average 1.4995348837209301) internal successors, (1612), 1075 states have internal predecessors, (1612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:45,218 INFO L87 Difference]: Start difference. First operand 1373 states. Second operand has 1080 states, 1075 states have (on average 1.4995348837209301) internal successors, (1612), 1075 states have internal predecessors, (1612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:45,267 INFO L93 Difference]: Finished difference Result 1373 states and 2026 transitions. [2022-04-15 18:18:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2026 transitions. [2022-04-15 18:18:45,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:45,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:45,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.4995348837209301) internal successors, (1612), 1075 states have internal predecessors, (1612), 3 states have call successors, (3), 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 1373 states. [2022-04-15 18:18:45,270 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.4995348837209301) internal successors, (1612), 1075 states have internal predecessors, (1612), 3 states have call successors, (3), 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 1373 states. [2022-04-15 18:18:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:45,319 INFO L93 Difference]: Finished difference Result 1373 states and 2026 transitions. [2022-04-15 18:18:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2026 transitions. [2022-04-15 18:18:45,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:45,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:45,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:18:45,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:18:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.4995348837209301) internal successors, (1612), 1075 states have internal predecessors, (1612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1616 transitions. [2022-04-15 18:18:45,367 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1616 transitions. Word has length 188 [2022-04-15 18:18:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:18:45,367 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1616 transitions. [2022-04-15 18:18:45,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:18:45,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1616 transitions. [2022-04-15 18:18:46,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1616 edges. 1616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1616 transitions. [2022-04-15 18:18:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-15 18:18:46,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:18:46,689 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:18:46,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:18:46,689 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:18:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:18:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1463643633, now seen corresponding path program 1 times [2022-04-15 18:18:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:46,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012051183] [2022-04-15 18:19:01,431 WARN L232 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:19:09,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1463643633, now seen corresponding path program 2 times [2022-04-15 18:19:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:09,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584526517] [2022-04-15 18:19:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:09,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {95983#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {95976#true} is VALID [2022-04-15 18:19:09,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {95976#true} assume true; {95976#true} is VALID [2022-04-15 18:19:09,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95976#true} {95976#true} #593#return; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {95976#true} call ULTIMATE.init(); {95983#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {95983#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {95976#true} assume true; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95976#true} {95976#true} #593#return; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {95976#true} call #t~ret158 := main(); {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {95976#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {95976#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {95976#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {95976#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {95976#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {95976#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {95976#true} assume !false; {95976#true} is VALID [2022-04-15 18:19:09,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {95976#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {95976#true} assume 12292 == #t~mem49;havoc #t~mem49; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {95976#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {95976#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {95976#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {95976#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {95976#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, 80 + ~s.offset, 8); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {95976#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {95976#true} assume !(0 == ~tmp___4~0); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {95976#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {95976#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {95976#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {95976#true} ~skip~0 := 0; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {95976#true} assume !false; {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {95976#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {95976#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {95976#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {95976#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {95976#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {95976#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {95976#true} assume 4368 == #t~mem54;havoc #t~mem54; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {95976#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {95976#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {95976#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {95976#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {95976#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {95976#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {95976#true} ~skip~0 := 0; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {95976#true} assume !false; {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {95976#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {95976#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {95976#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {95976#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {95976#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {95976#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {95976#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {95976#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {95976#true} assume 4384 == #t~mem56;havoc #t~mem56; {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {95976#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {95976#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {95976#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {95976#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {95976#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {95976#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {95976#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {95976#true} ~skip~0 := 0; {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {95976#true} assume !false; {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {95976#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {95976#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {95976#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {95976#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {95976#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {95976#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {95976#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {95976#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {95976#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {95976#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {95976#true} assume 4400 == #t~mem58;havoc #t~mem58; {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {95976#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {95976#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {95976#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {95976#true} assume !(~ret~0 <= 0); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 74: Hoare triple {95976#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {95976#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {95976#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {95976#true} ~skip~0 := 0; {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 78: Hoare triple {95976#true} assume !false; {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {95976#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 80: Hoare triple {95976#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 81: Hoare triple {95976#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {95976#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 83: Hoare triple {95976#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {95976#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {95976#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {95976#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {95976#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {95976#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 89: Hoare triple {95976#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 90: Hoare triple {95976#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 91: Hoare triple {95976#true} assume 4416 == #t~mem60;havoc #t~mem60; {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 92: Hoare triple {95976#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {95976#true} is VALID [2022-04-15 18:19:09,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {95976#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {95976#true} is VALID [2022-04-15 18:19:09,317 INFO L290 TraceCheckUtils]: 94: Hoare triple {95976#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,317 INFO L290 TraceCheckUtils]: 95: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,318 INFO L290 TraceCheckUtils]: 97: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,318 INFO L290 TraceCheckUtils]: 98: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,318 INFO L290 TraceCheckUtils]: 99: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,319 INFO L290 TraceCheckUtils]: 100: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,319 INFO L290 TraceCheckUtils]: 101: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,319 INFO L290 TraceCheckUtils]: 102: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:09,319 INFO L290 TraceCheckUtils]: 103: Hoare triple {95981#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95982#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 104: Hoare triple {95982#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 105: Hoare triple {95977#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {95977#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 107: Hoare triple {95977#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 108: Hoare triple {95977#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, 80 + ~s.offset, 8); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 109: Hoare triple {95977#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 110: Hoare triple {95977#false} assume !(0 == ~tmp___4~0); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 111: Hoare triple {95977#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 112: Hoare triple {95977#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 113: Hoare triple {95977#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 114: Hoare triple {95977#false} ~skip~0 := 0; {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 115: Hoare triple {95977#false} assume !false; {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 116: Hoare triple {95977#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,320 INFO L290 TraceCheckUtils]: 117: Hoare triple {95977#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 118: Hoare triple {95977#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 119: Hoare triple {95977#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 120: Hoare triple {95977#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 121: Hoare triple {95977#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 122: Hoare triple {95977#false} assume 4368 == #t~mem54;havoc #t~mem54; {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 123: Hoare triple {95977#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 124: Hoare triple {95977#false} assume !(0 == ~blastFlag~0); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 125: Hoare triple {95977#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 126: Hoare triple {95977#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 127: Hoare triple {95977#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 128: Hoare triple {95977#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 129: Hoare triple {95977#false} ~skip~0 := 0; {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 130: Hoare triple {95977#false} assume !false; {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 131: Hoare triple {95977#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 132: Hoare triple {95977#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 133: Hoare triple {95977#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 134: Hoare triple {95977#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,321 INFO L290 TraceCheckUtils]: 135: Hoare triple {95977#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 136: Hoare triple {95977#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 137: Hoare triple {95977#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 138: Hoare triple {95977#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 139: Hoare triple {95977#false} assume 4384 == #t~mem56;havoc #t~mem56; {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 140: Hoare triple {95977#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 141: Hoare triple {95977#false} assume !(1 == ~blastFlag~0); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 142: Hoare triple {95977#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 143: Hoare triple {95977#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 144: Hoare triple {95977#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 145: Hoare triple {95977#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 146: Hoare triple {95977#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 147: Hoare triple {95977#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 148: Hoare triple {95977#false} ~skip~0 := 0; {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 149: Hoare triple {95977#false} assume !false; {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 150: Hoare triple {95977#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 151: Hoare triple {95977#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 152: Hoare triple {95977#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,322 INFO L290 TraceCheckUtils]: 153: Hoare triple {95977#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 154: Hoare triple {95977#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 155: Hoare triple {95977#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 156: Hoare triple {95977#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 157: Hoare triple {95977#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 158: Hoare triple {95977#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 159: Hoare triple {95977#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 160: Hoare triple {95977#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 161: Hoare triple {95977#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 162: Hoare triple {95977#false} assume 4416 == #t~mem60;havoc #t~mem60; {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 163: Hoare triple {95977#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 164: Hoare triple {95977#false} assume !(3 == ~blastFlag~0); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 165: Hoare triple {95977#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 166: Hoare triple {95977#false} assume !(0 == ~tmp___6~0); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 167: Hoare triple {95977#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 168: Hoare triple {95977#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 169: Hoare triple {95977#false} ~skip~0 := 0; {95977#false} is VALID [2022-04-15 18:19:09,323 INFO L290 TraceCheckUtils]: 170: Hoare triple {95977#false} assume !false; {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 171: Hoare triple {95977#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 172: Hoare triple {95977#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 173: Hoare triple {95977#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 174: Hoare triple {95977#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 175: Hoare triple {95977#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 176: Hoare triple {95977#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 177: Hoare triple {95977#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 178: Hoare triple {95977#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 179: Hoare triple {95977#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 180: Hoare triple {95977#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 181: Hoare triple {95977#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 182: Hoare triple {95977#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 183: Hoare triple {95977#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 184: Hoare triple {95977#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 185: Hoare triple {95977#false} assume 4432 == #t~mem62;havoc #t~mem62; {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 186: Hoare triple {95977#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 187: Hoare triple {95977#false} assume 5 == ~blastFlag~0; {95977#false} is VALID [2022-04-15 18:19:09,324 INFO L290 TraceCheckUtils]: 188: Hoare triple {95977#false} assume !false; {95977#false} is VALID [2022-04-15 18:19:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 18:19:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584526517] [2022-04-15 18:19:09,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584526517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:09,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:09,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:09,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012051183] [2022-04-15 18:19:09,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012051183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:09,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393762973] [2022-04-15 18:19:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:09,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2022-04-15 18:19:09,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:09,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:09,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:09,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:09,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:09,410 INFO L87 Difference]: Start difference. First operand 1080 states and 1616 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:11,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:12,932 INFO L93 Difference]: Finished difference Result 2437 states and 3622 transitions. [2022-04-15 18:19:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2022-04-15 18:19:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-15 18:19:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-15 18:19:12,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 454 transitions. [2022-04-15 18:19:13,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:13,295 INFO L225 Difference]: With dead ends: 2437 [2022-04-15 18:19:13,296 INFO L226 Difference]: Without dead ends: 1373 [2022-04-15 18:19:13,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:13,306 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 91 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:13,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 539 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 506 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:19:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-04-15 18:19:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1080. [2022-04-15 18:19:13,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:13,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1373 states. Second operand has 1080 states, 1075 states have (on average 1.4948837209302326) internal successors, (1607), 1075 states have internal predecessors, (1607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:13,428 INFO L74 IsIncluded]: Start isIncluded. First operand 1373 states. Second operand has 1080 states, 1075 states have (on average 1.4948837209302326) internal successors, (1607), 1075 states have internal predecessors, (1607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:13,428 INFO L87 Difference]: Start difference. First operand 1373 states. Second operand has 1080 states, 1075 states have (on average 1.4948837209302326) internal successors, (1607), 1075 states have internal predecessors, (1607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:13,534 INFO L93 Difference]: Finished difference Result 1373 states and 2021 transitions. [2022-04-15 18:19:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2021 transitions. [2022-04-15 18:19:13,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:13,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:13,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.4948837209302326) internal successors, (1607), 1075 states have internal predecessors, (1607), 3 states have call successors, (3), 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 1373 states. [2022-04-15 18:19:13,538 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.4948837209302326) internal successors, (1607), 1075 states have internal predecessors, (1607), 3 states have call successors, (3), 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 1373 states. [2022-04-15 18:19:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:13,588 INFO L93 Difference]: Finished difference Result 1373 states and 2021 transitions. [2022-04-15 18:19:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2021 transitions. [2022-04-15 18:19:13,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:13,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:13,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:13,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.4948837209302326) internal successors, (1607), 1075 states have internal predecessors, (1607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1611 transitions. [2022-04-15 18:19:13,636 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1611 transitions. Word has length 189 [2022-04-15 18:19:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:13,636 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1611 transitions. [2022-04-15 18:19:13,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:13,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1611 transitions. [2022-04-15 18:19:15,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1611 edges. 1611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1611 transitions. [2022-04-15 18:19:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-04-15 18:19:15,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:15,117 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:19:15,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:19:15,117 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1615522612, now seen corresponding path program 1 times [2022-04-15 18:19:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:15,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951085243] [2022-04-15 18:19:34,479 WARN L232 SmtUtils]: Spent 12.36s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:19:43,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1615522612, now seen corresponding path program 2 times [2022-04-15 18:19:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:43,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650001710] [2022-04-15 18:19:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:43,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {105775#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {105768#true} is VALID [2022-04-15 18:19:43,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {105768#true} assume true; {105768#true} is VALID [2022-04-15 18:19:43,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105768#true} {105768#true} #593#return; {105768#true} is VALID [2022-04-15 18:19:43,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {105768#true} call ULTIMATE.init(); {105775#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:43,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {105775#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {105768#true} assume true; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105768#true} {105768#true} #593#return; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {105768#true} call #t~ret158 := main(); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {105768#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {105768#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {105768#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {105768#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {105768#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {105768#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {105768#true} assume !false; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {105768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {105768#true} assume 12292 == #t~mem49;havoc #t~mem49; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {105768#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {105768#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {105768#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {105768#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {105768#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, 80 + ~s.offset, 8); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {105768#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {105768#true} assume !(0 == ~tmp___4~0); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {105768#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {105768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {105768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {105768#true} ~skip~0 := 0; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {105768#true} assume !false; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {105768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {105768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {105768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {105768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {105768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {105768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {105768#true} assume 4368 == #t~mem54;havoc #t~mem54; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {105768#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {105768#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {105768#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {105768#true} is VALID [2022-04-15 18:19:43,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {105768#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {105768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {105768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {105768#true} ~skip~0 := 0; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {105768#true} assume !false; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {105768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {105768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {105768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {105768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {105768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {105768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {105768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {105768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {105768#true} assume 4384 == #t~mem56;havoc #t~mem56; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {105768#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {105768#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {105768#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {105768#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {105768#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 55: Hoare triple {105768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {105768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {105768#true} ~skip~0 := 0; {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {105768#true} assume !false; {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {105768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 60: Hoare triple {105768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {105768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 62: Hoare triple {105768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {105768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {105768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {105768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {105768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {105768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {105768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {105768#true} assume 4400 == #t~mem58;havoc #t~mem58; {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {105768#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {105768#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {105768#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {105768#true} assume !(~ret~0 <= 0); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {105768#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {105768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {105768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {105768#true} ~skip~0 := 0; {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {105768#true} assume !false; {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 79: Hoare triple {105768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 80: Hoare triple {105768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 81: Hoare triple {105768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 82: Hoare triple {105768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,861 INFO L290 TraceCheckUtils]: 83: Hoare triple {105768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {105768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {105768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 86: Hoare triple {105768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 87: Hoare triple {105768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {105768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {105768#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 90: Hoare triple {105768#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 91: Hoare triple {105768#true} assume 4416 == #t~mem60;havoc #t~mem60; {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 92: Hoare triple {105768#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105768#true} is VALID [2022-04-15 18:19:43,862 INFO L290 TraceCheckUtils]: 93: Hoare triple {105768#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105768#true} is VALID [2022-04-15 18:19:43,864 INFO L290 TraceCheckUtils]: 94: Hoare triple {105768#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,864 INFO L290 TraceCheckUtils]: 95: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,864 INFO L290 TraceCheckUtils]: 96: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,865 INFO L290 TraceCheckUtils]: 97: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,865 INFO L290 TraceCheckUtils]: 98: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,865 INFO L290 TraceCheckUtils]: 99: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,865 INFO L290 TraceCheckUtils]: 100: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,866 INFO L290 TraceCheckUtils]: 101: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,866 INFO L290 TraceCheckUtils]: 102: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,866 INFO L290 TraceCheckUtils]: 103: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 104: Hoare triple {105773#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105774#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {105774#(= |ssl3_connect_#t~mem53| 4432)} assume 4099 == #t~mem53;havoc #t~mem53; {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 106: Hoare triple {105769#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 107: Hoare triple {105769#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 108: Hoare triple {105769#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 109: Hoare triple {105769#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, 80 + ~s.offset, 8); {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 110: Hoare triple {105769#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 111: Hoare triple {105769#false} assume !(0 == ~tmp___4~0); {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 112: Hoare triple {105769#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 113: Hoare triple {105769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,867 INFO L290 TraceCheckUtils]: 114: Hoare triple {105769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 115: Hoare triple {105769#false} ~skip~0 := 0; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 116: Hoare triple {105769#false} assume !false; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 117: Hoare triple {105769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 118: Hoare triple {105769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 119: Hoare triple {105769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 120: Hoare triple {105769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 121: Hoare triple {105769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 122: Hoare triple {105769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 123: Hoare triple {105769#false} assume 4368 == #t~mem54;havoc #t~mem54; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 124: Hoare triple {105769#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 125: Hoare triple {105769#false} assume !(0 == ~blastFlag~0); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 126: Hoare triple {105769#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 127: Hoare triple {105769#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 128: Hoare triple {105769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {105769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 130: Hoare triple {105769#false} ~skip~0 := 0; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 131: Hoare triple {105769#false} assume !false; {105769#false} is VALID [2022-04-15 18:19:43,868 INFO L290 TraceCheckUtils]: 132: Hoare triple {105769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 133: Hoare triple {105769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 134: Hoare triple {105769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 135: Hoare triple {105769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 136: Hoare triple {105769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 137: Hoare triple {105769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 138: Hoare triple {105769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 139: Hoare triple {105769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 140: Hoare triple {105769#false} assume 4384 == #t~mem56;havoc #t~mem56; {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 141: Hoare triple {105769#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 142: Hoare triple {105769#false} assume !(1 == ~blastFlag~0); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 143: Hoare triple {105769#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 144: Hoare triple {105769#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 145: Hoare triple {105769#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 146: Hoare triple {105769#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 147: Hoare triple {105769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 148: Hoare triple {105769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 149: Hoare triple {105769#false} ~skip~0 := 0; {105769#false} is VALID [2022-04-15 18:19:43,869 INFO L290 TraceCheckUtils]: 150: Hoare triple {105769#false} assume !false; {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 151: Hoare triple {105769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 152: Hoare triple {105769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 153: Hoare triple {105769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 154: Hoare triple {105769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 155: Hoare triple {105769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 156: Hoare triple {105769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 157: Hoare triple {105769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 158: Hoare triple {105769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 159: Hoare triple {105769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 160: Hoare triple {105769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 161: Hoare triple {105769#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 162: Hoare triple {105769#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 163: Hoare triple {105769#false} assume 4416 == #t~mem60;havoc #t~mem60; {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 164: Hoare triple {105769#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 165: Hoare triple {105769#false} assume !(3 == ~blastFlag~0); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 166: Hoare triple {105769#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,870 INFO L290 TraceCheckUtils]: 167: Hoare triple {105769#false} assume !(0 == ~tmp___6~0); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 168: Hoare triple {105769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 169: Hoare triple {105769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 170: Hoare triple {105769#false} ~skip~0 := 0; {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 171: Hoare triple {105769#false} assume !false; {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 172: Hoare triple {105769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 173: Hoare triple {105769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 174: Hoare triple {105769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 175: Hoare triple {105769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 176: Hoare triple {105769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 177: Hoare triple {105769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 178: Hoare triple {105769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 179: Hoare triple {105769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 180: Hoare triple {105769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 181: Hoare triple {105769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 182: Hoare triple {105769#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 183: Hoare triple {105769#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,871 INFO L290 TraceCheckUtils]: 184: Hoare triple {105769#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,872 INFO L290 TraceCheckUtils]: 185: Hoare triple {105769#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {105769#false} is VALID [2022-04-15 18:19:43,872 INFO L290 TraceCheckUtils]: 186: Hoare triple {105769#false} assume 4432 == #t~mem62;havoc #t~mem62; {105769#false} is VALID [2022-04-15 18:19:43,872 INFO L290 TraceCheckUtils]: 187: Hoare triple {105769#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105769#false} is VALID [2022-04-15 18:19:43,872 INFO L290 TraceCheckUtils]: 188: Hoare triple {105769#false} assume 5 == ~blastFlag~0; {105769#false} is VALID [2022-04-15 18:19:43,872 INFO L290 TraceCheckUtils]: 189: Hoare triple {105769#false} assume !false; {105769#false} is VALID [2022-04-15 18:19:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 18:19:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:43,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650001710] [2022-04-15 18:19:43,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650001710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:43,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:43,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:43,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:43,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951085243] [2022-04-15 18:19:43,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951085243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:43,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:43,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575174757] [2022-04-15 18:19:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 190 [2022-04-15 18:19:43,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:43,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:43,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:43,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:43,951 INFO L87 Difference]: Start difference. First operand 1080 states and 1611 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:45,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:47,368 INFO L93 Difference]: Finished difference Result 2392 states and 3557 transitions. [2022-04-15 18:19:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 190 [2022-04-15 18:19:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:19:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 18:19:47,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 18:19:47,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:47,742 INFO L225 Difference]: With dead ends: 2392 [2022-04-15 18:19:47,742 INFO L226 Difference]: Without dead ends: 1328 [2022-04-15 18:19:47,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:19:47,744 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 82 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:47,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 525 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:19:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-04-15 18:19:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1080. [2022-04-15 18:19:47,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:47,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1328 states. Second operand has 1080 states, 1075 states have (on average 1.4902325581395348) internal successors, (1602), 1075 states have internal predecessors, (1602), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,820 INFO L74 IsIncluded]: Start isIncluded. First operand 1328 states. Second operand has 1080 states, 1075 states have (on average 1.4902325581395348) internal successors, (1602), 1075 states have internal predecessors, (1602), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,821 INFO L87 Difference]: Start difference. First operand 1328 states. Second operand has 1080 states, 1075 states have (on average 1.4902325581395348) internal successors, (1602), 1075 states have internal predecessors, (1602), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:47,867 INFO L93 Difference]: Finished difference Result 1328 states and 1961 transitions. [2022-04-15 18:19:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1961 transitions. [2022-04-15 18:19:47,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:47,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:47,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.4902325581395348) internal successors, (1602), 1075 states have internal predecessors, (1602), 3 states have call successors, (3), 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 1328 states. [2022-04-15 18:19:47,870 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.4902325581395348) internal successors, (1602), 1075 states have internal predecessors, (1602), 3 states have call successors, (3), 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 1328 states. [2022-04-15 18:19:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:47,916 INFO L93 Difference]: Finished difference Result 1328 states and 1961 transitions. [2022-04-15 18:19:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1961 transitions. [2022-04-15 18:19:47,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:47,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:47,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:47,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.4902325581395348) internal successors, (1602), 1075 states have internal predecessors, (1602), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1606 transitions. [2022-04-15 18:19:47,974 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1606 transitions. Word has length 190 [2022-04-15 18:19:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:47,974 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1606 transitions. [2022-04-15 18:19:47,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:47,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1606 transitions. [2022-04-15 18:19:49,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1606 edges. 1606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1606 transitions. [2022-04-15 18:19:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-04-15 18:19:49,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:49,442 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:19:49,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 18:19:49,442 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:49,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -925518790, now seen corresponding path program 1 times [2022-04-15 18:19:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:49,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652435600] [2022-04-15 18:20:04,483 WARN L232 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:20:13,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:20:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -925518790, now seen corresponding path program 2 times [2022-04-15 18:20:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:20:13,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773140135] [2022-04-15 18:20:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:20:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:20:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:20:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:13,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {115387#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {115380#true} is VALID [2022-04-15 18:20:13,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {115380#true} assume true; {115380#true} is VALID [2022-04-15 18:20:13,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115380#true} {115380#true} #593#return; {115380#true} is VALID [2022-04-15 18:20:13,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {115380#true} call ULTIMATE.init(); {115387#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {115387#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {115380#true} assume true; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115380#true} {115380#true} #593#return; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {115380#true} call #t~ret158 := main(); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {115380#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {115380#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {115380#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {115380#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {115380#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {115380#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {115380#true} assume !false; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {115380#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {115380#true} assume 12292 == #t~mem49;havoc #t~mem49; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {115380#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {115380#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {115380#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {115380#true} is VALID [2022-04-15 18:20:13,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {115380#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {115380#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, 80 + ~s.offset, 8); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {115380#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {115380#true} assume !(0 == ~tmp___4~0); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {115380#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {115380#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {115380#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {115380#true} ~skip~0 := 0; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {115380#true} assume !false; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {115380#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {115380#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {115380#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {115380#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {115380#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {115380#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {115380#true} assume 4368 == #t~mem54;havoc #t~mem54; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {115380#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {115380#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {115380#true} is VALID [2022-04-15 18:20:13,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {115380#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {115380#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {115380#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {115380#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {115380#true} ~skip~0 := 0; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {115380#true} assume !false; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {115380#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {115380#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {115380#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {115380#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {115380#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {115380#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {115380#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {115380#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {115380#true} assume 4384 == #t~mem56;havoc #t~mem56; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {115380#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {115380#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {115380#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {115380#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {115380#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {115380#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {115380#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {115380#true} ~skip~0 := 0; {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {115380#true} assume !false; {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {115380#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {115380#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {115380#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {115380#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {115380#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {115380#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {115380#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {115380#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {115380#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {115380#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {115380#true} assume 4400 == #t~mem58;havoc #t~mem58; {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {115380#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {115380#true} is VALID [2022-04-15 18:20:13,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {115380#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {115380#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {115380#true} assume !(~ret~0 <= 0); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {115380#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {115380#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {115380#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {115380#true} ~skip~0 := 0; {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 78: Hoare triple {115380#true} assume !false; {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {115380#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {115380#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {115380#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {115380#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {115380#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {115380#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {115380#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {115380#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 87: Hoare triple {115380#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 88: Hoare triple {115380#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,595 INFO L290 TraceCheckUtils]: 89: Hoare triple {115380#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {115380#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {115380#true} is VALID [2022-04-15 18:20:13,596 INFO L290 TraceCheckUtils]: 91: Hoare triple {115380#true} assume 4416 == #t~mem60;havoc #t~mem60; {115380#true} is VALID [2022-04-15 18:20:13,596 INFO L290 TraceCheckUtils]: 92: Hoare triple {115380#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {115380#true} is VALID [2022-04-15 18:20:13,596 INFO L290 TraceCheckUtils]: 93: Hoare triple {115380#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {115380#true} is VALID [2022-04-15 18:20:13,596 INFO L290 TraceCheckUtils]: 94: Hoare triple {115380#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,597 INFO L290 TraceCheckUtils]: 95: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,597 INFO L290 TraceCheckUtils]: 97: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,598 INFO L290 TraceCheckUtils]: 98: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,598 INFO L290 TraceCheckUtils]: 99: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,598 INFO L290 TraceCheckUtils]: 100: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,599 INFO L290 TraceCheckUtils]: 101: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,599 INFO L290 TraceCheckUtils]: 102: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,599 INFO L290 TraceCheckUtils]: 103: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,600 INFO L290 TraceCheckUtils]: 106: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,600 INFO L290 TraceCheckUtils]: 107: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,601 INFO L290 TraceCheckUtils]: 108: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:13,601 INFO L290 TraceCheckUtils]: 109: Hoare triple {115385#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115386#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-15 18:20:13,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {115386#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {115381#false} is VALID [2022-04-15 18:20:13,601 INFO L290 TraceCheckUtils]: 111: Hoare triple {115381#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {115381#false} is VALID [2022-04-15 18:20:13,601 INFO L290 TraceCheckUtils]: 112: Hoare triple {115381#false} assume 0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616;havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;~skip~0 := 1; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {115381#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {115381#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 115: Hoare triple {115381#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {115381#false} ~skip~0 := 0; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 117: Hoare triple {115381#false} assume !false; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 118: Hoare triple {115381#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 119: Hoare triple {115381#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 120: Hoare triple {115381#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 121: Hoare triple {115381#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 122: Hoare triple {115381#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 123: Hoare triple {115381#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 124: Hoare triple {115381#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 125: Hoare triple {115381#false} assume 4369 == #t~mem55;havoc #t~mem55; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 126: Hoare triple {115381#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 127: Hoare triple {115381#false} assume !(0 == ~blastFlag~0); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 128: Hoare triple {115381#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 129: Hoare triple {115381#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {115381#false} is VALID [2022-04-15 18:20:13,602 INFO L290 TraceCheckUtils]: 130: Hoare triple {115381#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 131: Hoare triple {115381#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 132: Hoare triple {115381#false} ~skip~0 := 0; {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 133: Hoare triple {115381#false} assume !false; {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 134: Hoare triple {115381#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 135: Hoare triple {115381#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 136: Hoare triple {115381#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 137: Hoare triple {115381#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 138: Hoare triple {115381#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 139: Hoare triple {115381#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 140: Hoare triple {115381#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 141: Hoare triple {115381#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 142: Hoare triple {115381#false} assume 4384 == #t~mem56;havoc #t~mem56; {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 143: Hoare triple {115381#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 144: Hoare triple {115381#false} assume !(1 == ~blastFlag~0); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 145: Hoare triple {115381#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 146: Hoare triple {115381#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 147: Hoare triple {115381#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,603 INFO L290 TraceCheckUtils]: 148: Hoare triple {115381#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 149: Hoare triple {115381#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 150: Hoare triple {115381#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 151: Hoare triple {115381#false} ~skip~0 := 0; {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 152: Hoare triple {115381#false} assume !false; {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 153: Hoare triple {115381#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 154: Hoare triple {115381#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 155: Hoare triple {115381#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 156: Hoare triple {115381#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 157: Hoare triple {115381#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 158: Hoare triple {115381#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 159: Hoare triple {115381#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 160: Hoare triple {115381#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 161: Hoare triple {115381#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 162: Hoare triple {115381#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 163: Hoare triple {115381#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 164: Hoare triple {115381#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 165: Hoare triple {115381#false} assume 4416 == #t~mem60;havoc #t~mem60; {115381#false} is VALID [2022-04-15 18:20:13,604 INFO L290 TraceCheckUtils]: 166: Hoare triple {115381#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 167: Hoare triple {115381#false} assume !(3 == ~blastFlag~0); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 168: Hoare triple {115381#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 169: Hoare triple {115381#false} assume !(0 == ~tmp___6~0); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 170: Hoare triple {115381#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 171: Hoare triple {115381#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 172: Hoare triple {115381#false} ~skip~0 := 0; {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 173: Hoare triple {115381#false} assume !false; {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 174: Hoare triple {115381#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 175: Hoare triple {115381#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 176: Hoare triple {115381#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 177: Hoare triple {115381#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 178: Hoare triple {115381#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 179: Hoare triple {115381#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 180: Hoare triple {115381#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 181: Hoare triple {115381#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 182: Hoare triple {115381#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 183: Hoare triple {115381#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,605 INFO L290 TraceCheckUtils]: 184: Hoare triple {115381#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 185: Hoare triple {115381#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 186: Hoare triple {115381#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 187: Hoare triple {115381#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 188: Hoare triple {115381#false} assume 4432 == #t~mem62;havoc #t~mem62; {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 189: Hoare triple {115381#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 190: Hoare triple {115381#false} assume 5 == ~blastFlag~0; {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L290 TraceCheckUtils]: 191: Hoare triple {115381#false} assume !false; {115381#false} is VALID [2022-04-15 18:20:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-15 18:20:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:20:13,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773140135] [2022-04-15 18:20:13,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773140135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:13,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:13,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:13,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:20:13,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652435600] [2022-04-15 18:20:13,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652435600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:13,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:13,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212713231] [2022-04-15 18:20:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:20:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 192 [2022-04-15 18:20:13,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:20:13,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:13,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:13,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:20:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:20:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:20:13,684 INFO L87 Difference]: Start difference. First operand 1080 states and 1606 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:15,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:20:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:16,963 INFO L93 Difference]: Finished difference Result 2625 states and 3871 transitions. [2022-04-15 18:20:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:20:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 192 [2022-04-15 18:20:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:20:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:20:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:20:16,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:20:17,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:17,347 INFO L225 Difference]: With dead ends: 2625 [2022-04-15 18:20:17,347 INFO L226 Difference]: Without dead ends: 1561 [2022-04-15 18:20:17,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:20:17,349 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 108 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:20:17,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 286 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:20:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-04-15 18:20:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1164. [2022-04-15 18:20:17,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:20:17,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1561 states. Second operand has 1164 states, 1159 states have (on average 1.4797238999137188) internal successors, (1715), 1159 states have internal predecessors, (1715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:17,463 INFO L74 IsIncluded]: Start isIncluded. First operand 1561 states. Second operand has 1164 states, 1159 states have (on average 1.4797238999137188) internal successors, (1715), 1159 states have internal predecessors, (1715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:17,464 INFO L87 Difference]: Start difference. First operand 1561 states. Second operand has 1164 states, 1159 states have (on average 1.4797238999137188) internal successors, (1715), 1159 states have internal predecessors, (1715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:17,536 INFO L93 Difference]: Finished difference Result 1561 states and 2274 transitions. [2022-04-15 18:20:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2274 transitions. [2022-04-15 18:20:17,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:17,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:17,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 1159 states have (on average 1.4797238999137188) internal successors, (1715), 1159 states have internal predecessors, (1715), 3 states have call successors, (3), 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 1561 states. [2022-04-15 18:20:17,540 INFO L87 Difference]: Start difference. First operand has 1164 states, 1159 states have (on average 1.4797238999137188) internal successors, (1715), 1159 states have internal predecessors, (1715), 3 states have call successors, (3), 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 1561 states. [2022-04-15 18:20:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:17,608 INFO L93 Difference]: Finished difference Result 1561 states and 2274 transitions. [2022-04-15 18:20:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2274 transitions. [2022-04-15 18:20:17,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:17,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:17,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:20:17,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:20:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1159 states have (on average 1.4797238999137188) internal successors, (1715), 1159 states have internal predecessors, (1715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1719 transitions. [2022-04-15 18:20:17,674 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1719 transitions. Word has length 192 [2022-04-15 18:20:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:20:17,674 INFO L478 AbstractCegarLoop]: Abstraction has 1164 states and 1719 transitions. [2022-04-15 18:20:17,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:17,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1719 transitions. [2022-04-15 18:20:19,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1719 transitions. [2022-04-15 18:20:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-15 18:20:19,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:20:19,276 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:20:19,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 18:20:19,277 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:20:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:20:19,277 INFO L85 PathProgramCache]: Analyzing trace with hash -186614217, now seen corresponding path program 1 times [2022-04-15 18:20:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:19,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571863764] [2022-04-15 18:20:34,113 WARN L232 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:20:41,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:20:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash -186614217, now seen corresponding path program 2 times [2022-04-15 18:20:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:20:41,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484474211] [2022-04-15 18:20:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:20:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:20:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:20:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:20:41,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {126099#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {126092#true} is VALID [2022-04-15 18:20:41,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {126092#true} assume true; {126092#true} is VALID [2022-04-15 18:20:41,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126092#true} {126092#true} #593#return; {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {126092#true} call ULTIMATE.init(); {126099#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:20:41,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {126099#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {126092#true} assume true; {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126092#true} {126092#true} #593#return; {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {126092#true} call #t~ret158 := main(); {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {126092#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {126092#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {126092#true} is VALID [2022-04-15 18:20:41,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {126092#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {126092#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {126092#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {126092#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {126092#true} assume !false; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {126092#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {126092#true} assume 12292 == #t~mem49;havoc #t~mem49; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {126092#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {126092#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {126092#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {126092#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {126092#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, 80 + ~s.offset, 8); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {126092#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {126092#true} assume !(0 == ~tmp___4~0); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {126092#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {126092#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {126092#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126092#true} is VALID [2022-04-15 18:20:41,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {126092#true} ~skip~0 := 0; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {126092#true} assume !false; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {126092#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {126092#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {126092#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {126092#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {126092#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {126092#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {126092#true} assume 4368 == #t~mem54;havoc #t~mem54; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {126092#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {126092#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {126092#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {126092#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {126092#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {126092#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {126092#true} ~skip~0 := 0; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {126092#true} assume !false; {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {126092#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {126092#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {126092#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {126092#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {126092#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {126092#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {126092#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {126092#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {126092#true} assume 4384 == #t~mem56;havoc #t~mem56; {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {126092#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {126092#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {126092#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {126092#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {126092#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {126092#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {126092#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {126092#true} ~skip~0 := 0; {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {126092#true} assume !false; {126092#true} is VALID [2022-04-15 18:20:41,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {126092#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {126092#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {126092#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {126092#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {126092#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {126092#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {126092#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {126092#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {126092#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {126092#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {126092#true} assume 4400 == #t~mem58;havoc #t~mem58; {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {126092#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {126092#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {126092#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {126092#true} assume !(~ret~0 <= 0); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {126092#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {126092#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {126092#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126092#true} is VALID [2022-04-15 18:20:41,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {126092#true} ~skip~0 := 0; {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {126092#true} assume !false; {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {126092#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {126092#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {126092#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 82: Hoare triple {126092#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {126092#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {126092#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {126092#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {126092#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 87: Hoare triple {126092#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {126092#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {126092#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 90: Hoare triple {126092#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {126092#true} assume 4416 == #t~mem60;havoc #t~mem60; {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {126092#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {126092#true} is VALID [2022-04-15 18:20:41,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {126092#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {126092#true} is VALID [2022-04-15 18:20:41,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {126092#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,198 INFO L290 TraceCheckUtils]: 95: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,200 INFO L290 TraceCheckUtils]: 99: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,200 INFO L290 TraceCheckUtils]: 100: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,200 INFO L290 TraceCheckUtils]: 101: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,201 INFO L290 TraceCheckUtils]: 103: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,201 INFO L290 TraceCheckUtils]: 104: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,202 INFO L290 TraceCheckUtils]: 105: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,202 INFO L290 TraceCheckUtils]: 106: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,202 INFO L290 TraceCheckUtils]: 107: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,202 INFO L290 TraceCheckUtils]: 108: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,203 INFO L290 TraceCheckUtils]: 109: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:20:41,203 INFO L290 TraceCheckUtils]: 110: Hoare triple {126097#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {126098#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-15 18:20:41,203 INFO L290 TraceCheckUtils]: 111: Hoare triple {126098#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {126093#false} is VALID [2022-04-15 18:20:41,203 INFO L290 TraceCheckUtils]: 112: Hoare triple {126093#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {126093#false} is VALID [2022-04-15 18:20:41,203 INFO L290 TraceCheckUtils]: 113: Hoare triple {126093#false} assume 0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616;havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;~skip~0 := 1; {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 114: Hoare triple {126093#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 115: Hoare triple {126093#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 116: Hoare triple {126093#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 117: Hoare triple {126093#false} ~skip~0 := 0; {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 118: Hoare triple {126093#false} assume !false; {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 119: Hoare triple {126093#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 120: Hoare triple {126093#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 121: Hoare triple {126093#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 122: Hoare triple {126093#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 123: Hoare triple {126093#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 124: Hoare triple {126093#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 125: Hoare triple {126093#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 126: Hoare triple {126093#false} assume 4369 == #t~mem55;havoc #t~mem55; {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 127: Hoare triple {126093#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 128: Hoare triple {126093#false} assume !(0 == ~blastFlag~0); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 129: Hoare triple {126093#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {126093#false} is VALID [2022-04-15 18:20:41,204 INFO L290 TraceCheckUtils]: 130: Hoare triple {126093#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 131: Hoare triple {126093#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 132: Hoare triple {126093#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 133: Hoare triple {126093#false} ~skip~0 := 0; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 134: Hoare triple {126093#false} assume !false; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 135: Hoare triple {126093#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 136: Hoare triple {126093#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 137: Hoare triple {126093#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 138: Hoare triple {126093#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 139: Hoare triple {126093#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 140: Hoare triple {126093#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 141: Hoare triple {126093#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 142: Hoare triple {126093#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 143: Hoare triple {126093#false} assume 4384 == #t~mem56;havoc #t~mem56; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 144: Hoare triple {126093#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 145: Hoare triple {126093#false} assume !(1 == ~blastFlag~0); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 146: Hoare triple {126093#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 147: Hoare triple {126093#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,205 INFO L290 TraceCheckUtils]: 148: Hoare triple {126093#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 149: Hoare triple {126093#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 150: Hoare triple {126093#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 151: Hoare triple {126093#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 152: Hoare triple {126093#false} ~skip~0 := 0; {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 153: Hoare triple {126093#false} assume !false; {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 154: Hoare triple {126093#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 155: Hoare triple {126093#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 156: Hoare triple {126093#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 157: Hoare triple {126093#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 158: Hoare triple {126093#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 159: Hoare triple {126093#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 160: Hoare triple {126093#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 161: Hoare triple {126093#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 162: Hoare triple {126093#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 163: Hoare triple {126093#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 164: Hoare triple {126093#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 165: Hoare triple {126093#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,206 INFO L290 TraceCheckUtils]: 166: Hoare triple {126093#false} assume 4416 == #t~mem60;havoc #t~mem60; {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 167: Hoare triple {126093#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 168: Hoare triple {126093#false} assume !(3 == ~blastFlag~0); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 169: Hoare triple {126093#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 170: Hoare triple {126093#false} assume !(0 == ~tmp___6~0); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 171: Hoare triple {126093#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 172: Hoare triple {126093#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 173: Hoare triple {126093#false} ~skip~0 := 0; {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 174: Hoare triple {126093#false} assume !false; {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 175: Hoare triple {126093#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 176: Hoare triple {126093#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 177: Hoare triple {126093#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 178: Hoare triple {126093#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 179: Hoare triple {126093#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 180: Hoare triple {126093#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 181: Hoare triple {126093#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 182: Hoare triple {126093#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 183: Hoare triple {126093#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,207 INFO L290 TraceCheckUtils]: 184: Hoare triple {126093#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 185: Hoare triple {126093#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 186: Hoare triple {126093#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 187: Hoare triple {126093#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 188: Hoare triple {126093#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 189: Hoare triple {126093#false} assume 4432 == #t~mem62;havoc #t~mem62; {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 190: Hoare triple {126093#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 191: Hoare triple {126093#false} assume 5 == ~blastFlag~0; {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L290 TraceCheckUtils]: 192: Hoare triple {126093#false} assume !false; {126093#false} is VALID [2022-04-15 18:20:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-04-15 18:20:41,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:20:41,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484474211] [2022-04-15 18:20:41,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484474211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:41,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:41,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:41,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:20:41,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571863764] [2022-04-15 18:20:41,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571863764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:20:41,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:20:41,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:20:41,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458805859] [2022-04-15 18:20:41,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:20:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 193 [2022-04-15 18:20:41,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:20:41,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:41,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:41,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:20:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:20:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:20:41,288 INFO L87 Difference]: Start difference. First operand 1164 states and 1719 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:43,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:20:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:44,575 INFO L93 Difference]: Finished difference Result 2679 states and 3929 transitions. [2022-04-15 18:20:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:20:44,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 193 [2022-04-15 18:20:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:20:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:20:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-15 18:20:44,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-15 18:20:44,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:44,979 INFO L225 Difference]: With dead ends: 2679 [2022-04-15 18:20:44,979 INFO L226 Difference]: Without dead ends: 1531 [2022-04-15 18:20:44,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:20:44,981 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:20:44,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 286 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:20:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-15 18:20:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1164. [2022-04-15 18:20:45,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:20:45,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1531 states. Second operand has 1164 states, 1159 states have (on average 1.4702329594477999) internal successors, (1704), 1159 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:45,064 INFO L74 IsIncluded]: Start isIncluded. First operand 1531 states. Second operand has 1164 states, 1159 states have (on average 1.4702329594477999) internal successors, (1704), 1159 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:45,065 INFO L87 Difference]: Start difference. First operand 1531 states. Second operand has 1164 states, 1159 states have (on average 1.4702329594477999) internal successors, (1704), 1159 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:45,122 INFO L93 Difference]: Finished difference Result 1531 states and 2219 transitions. [2022-04-15 18:20:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2219 transitions. [2022-04-15 18:20:45,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:45,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:45,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 1159 states have (on average 1.4702329594477999) internal successors, (1704), 1159 states have internal predecessors, (1704), 3 states have call successors, (3), 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 1531 states. [2022-04-15 18:20:45,125 INFO L87 Difference]: Start difference. First operand has 1164 states, 1159 states have (on average 1.4702329594477999) internal successors, (1704), 1159 states have internal predecessors, (1704), 3 states have call successors, (3), 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 1531 states. [2022-04-15 18:20:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:20:45,183 INFO L93 Difference]: Finished difference Result 1531 states and 2219 transitions. [2022-04-15 18:20:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2219 transitions. [2022-04-15 18:20:45,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:20:45,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:20:45,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:20:45,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:20:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1159 states have (on average 1.4702329594477999) internal successors, (1704), 1159 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1708 transitions. [2022-04-15 18:20:45,235 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1708 transitions. Word has length 193 [2022-04-15 18:20:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:20:45,235 INFO L478 AbstractCegarLoop]: Abstraction has 1164 states and 1708 transitions. [2022-04-15 18:20:45,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:20:45,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1708 transitions. [2022-04-15 18:20:46,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1708 edges. 1708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:20:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1708 transitions. [2022-04-15 18:20:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-15 18:20:46,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:20:46,798 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:20:46,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 18:20:46,798 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:20:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:20:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1552823950, now seen corresponding path program 1 times [2022-04-15 18:20:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:20:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221627797] [2022-04-15 18:21:00,423 WARN L232 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:21:09,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:21:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1552823950, now seen corresponding path program 2 times [2022-04-15 18:21:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:21:09,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666836517] [2022-04-15 18:21:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:21:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:21:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:21:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:09,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {136859#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {136852#true} is VALID [2022-04-15 18:21:09,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {136852#true} assume true; {136852#true} is VALID [2022-04-15 18:21:09,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136852#true} {136852#true} #593#return; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {136852#true} call ULTIMATE.init(); {136859#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {136859#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {136852#true} assume true; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136852#true} {136852#true} #593#return; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {136852#true} call #t~ret158 := main(); {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {136852#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {136852#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {136852#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {136852#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {136852#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {136852#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {136852#true} assume !false; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {136852#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {136852#true} assume 12292 == #t~mem49;havoc #t~mem49; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {136852#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {136852#true} is VALID [2022-04-15 18:21:09,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {136852#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {136852#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {136852#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {136852#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, 80 + ~s.offset, 8); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {136852#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {136852#true} assume !(0 == ~tmp___4~0); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {136852#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {136852#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {136852#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {136852#true} ~skip~0 := 0; {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {136852#true} assume !false; {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {136852#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {136852#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {136852#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {136852#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {136852#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {136852#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {136852#true} assume 4368 == #t~mem54;havoc #t~mem54; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {136852#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {136852#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {136852#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {136852#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {136852#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {136852#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {136852#true} ~skip~0 := 0; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {136852#true} assume !false; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {136852#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {136852#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {136852#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {136852#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {136852#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {136852#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {136852#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {136852#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {136852#true} assume 4384 == #t~mem56;havoc #t~mem56; {136852#true} is VALID [2022-04-15 18:21:09,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {136852#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {136852#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {136852#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {136852#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {136852#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {136852#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {136852#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {136852#true} ~skip~0 := 0; {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {136852#true} assume !false; {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {136852#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {136852#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {136852#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {136852#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {136852#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {136852#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {136852#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {136852#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {136852#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {136852#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {136852#true} assume 4400 == #t~mem58;havoc #t~mem58; {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {136852#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {136852#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {136852#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 73: Hoare triple {136852#true} assume !(~ret~0 <= 0); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {136852#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {136852#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 76: Hoare triple {136852#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 77: Hoare triple {136852#true} ~skip~0 := 0; {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 78: Hoare triple {136852#true} assume !false; {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 79: Hoare triple {136852#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {136852#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 81: Hoare triple {136852#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 82: Hoare triple {136852#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 83: Hoare triple {136852#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 84: Hoare triple {136852#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,958 INFO L290 TraceCheckUtils]: 85: Hoare triple {136852#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 86: Hoare triple {136852#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 87: Hoare triple {136852#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 88: Hoare triple {136852#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 89: Hoare triple {136852#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 90: Hoare triple {136852#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 91: Hoare triple {136852#true} assume 4416 == #t~mem60;havoc #t~mem60; {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 92: Hoare triple {136852#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {136852#true} is VALID [2022-04-15 18:21:09,959 INFO L290 TraceCheckUtils]: 93: Hoare triple {136852#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {136852#true} is VALID [2022-04-15 18:21:09,960 INFO L290 TraceCheckUtils]: 94: Hoare triple {136852#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,960 INFO L290 TraceCheckUtils]: 95: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,961 INFO L290 TraceCheckUtils]: 97: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,961 INFO L290 TraceCheckUtils]: 98: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,961 INFO L290 TraceCheckUtils]: 99: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,962 INFO L290 TraceCheckUtils]: 100: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,962 INFO L290 TraceCheckUtils]: 101: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,962 INFO L290 TraceCheckUtils]: 102: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,963 INFO L290 TraceCheckUtils]: 103: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,963 INFO L290 TraceCheckUtils]: 104: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,963 INFO L290 TraceCheckUtils]: 105: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,964 INFO L290 TraceCheckUtils]: 106: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,964 INFO L290 TraceCheckUtils]: 107: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,964 INFO L290 TraceCheckUtils]: 108: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,964 INFO L290 TraceCheckUtils]: 109: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,965 INFO L290 TraceCheckUtils]: 110: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,965 INFO L290 TraceCheckUtils]: 111: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,965 INFO L290 TraceCheckUtils]: 112: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,966 INFO L290 TraceCheckUtils]: 113: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,966 INFO L290 TraceCheckUtils]: 114: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,966 INFO L290 TraceCheckUtils]: 115: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,967 INFO L290 TraceCheckUtils]: 116: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,967 INFO L290 TraceCheckUtils]: 117: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,967 INFO L290 TraceCheckUtils]: 118: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,968 INFO L290 TraceCheckUtils]: 119: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,968 INFO L290 TraceCheckUtils]: 120: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,968 INFO L290 TraceCheckUtils]: 121: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,969 INFO L290 TraceCheckUtils]: 122: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,969 INFO L290 TraceCheckUtils]: 123: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,969 INFO L290 TraceCheckUtils]: 124: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 125: Hoare triple {136857#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136858#(not (= |ssl3_connect_#t~mem74| 4512))} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 126: Hoare triple {136858#(not (= |ssl3_connect_#t~mem74| 4512))} assume 4512 == #t~mem74;havoc #t~mem74; {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 127: Hoare triple {136853#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 128: Hoare triple {136853#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 129: Hoare triple {136853#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 130: Hoare triple {136853#false} assume !(0 == ~tmp___7~0); {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 131: Hoare triple {136853#false} assume !(0 == ~tmp___8~0); {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 132: Hoare triple {136853#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 133: Hoare triple {136853#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 134: Hoare triple {136853#false} ~skip~0 := 0; {136853#false} is VALID [2022-04-15 18:21:09,970 INFO L290 TraceCheckUtils]: 135: Hoare triple {136853#false} assume !false; {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 136: Hoare triple {136853#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 137: Hoare triple {136853#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 138: Hoare triple {136853#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 139: Hoare triple {136853#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 140: Hoare triple {136853#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 141: Hoare triple {136853#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 142: Hoare triple {136853#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 143: Hoare triple {136853#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 144: Hoare triple {136853#false} assume 4384 == #t~mem56;havoc #t~mem56; {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 145: Hoare triple {136853#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 146: Hoare triple {136853#false} assume !(1 == ~blastFlag~0); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 147: Hoare triple {136853#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 148: Hoare triple {136853#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 149: Hoare triple {136853#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 150: Hoare triple {136853#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 151: Hoare triple {136853#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 152: Hoare triple {136853#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136853#false} is VALID [2022-04-15 18:21:09,971 INFO L290 TraceCheckUtils]: 153: Hoare triple {136853#false} ~skip~0 := 0; {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 154: Hoare triple {136853#false} assume !false; {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 155: Hoare triple {136853#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 156: Hoare triple {136853#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 157: Hoare triple {136853#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 158: Hoare triple {136853#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 159: Hoare triple {136853#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 160: Hoare triple {136853#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 161: Hoare triple {136853#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 162: Hoare triple {136853#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 163: Hoare triple {136853#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 164: Hoare triple {136853#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 165: Hoare triple {136853#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 166: Hoare triple {136853#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 167: Hoare triple {136853#false} assume 4416 == #t~mem60;havoc #t~mem60; {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 168: Hoare triple {136853#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 169: Hoare triple {136853#false} assume !(3 == ~blastFlag~0); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 170: Hoare triple {136853#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,972 INFO L290 TraceCheckUtils]: 171: Hoare triple {136853#false} assume !(0 == ~tmp___6~0); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 172: Hoare triple {136853#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 173: Hoare triple {136853#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 174: Hoare triple {136853#false} ~skip~0 := 0; {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 175: Hoare triple {136853#false} assume !false; {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 176: Hoare triple {136853#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 177: Hoare triple {136853#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 178: Hoare triple {136853#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 179: Hoare triple {136853#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 180: Hoare triple {136853#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 181: Hoare triple {136853#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 182: Hoare triple {136853#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 183: Hoare triple {136853#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 184: Hoare triple {136853#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 185: Hoare triple {136853#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 186: Hoare triple {136853#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 187: Hoare triple {136853#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 188: Hoare triple {136853#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,973 INFO L290 TraceCheckUtils]: 189: Hoare triple {136853#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136853#false} is VALID [2022-04-15 18:21:09,974 INFO L290 TraceCheckUtils]: 190: Hoare triple {136853#false} assume 4432 == #t~mem62;havoc #t~mem62; {136853#false} is VALID [2022-04-15 18:21:09,974 INFO L290 TraceCheckUtils]: 191: Hoare triple {136853#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {136853#false} is VALID [2022-04-15 18:21:09,974 INFO L290 TraceCheckUtils]: 192: Hoare triple {136853#false} assume 5 == ~blastFlag~0; {136853#false} is VALID [2022-04-15 18:21:09,974 INFO L290 TraceCheckUtils]: 193: Hoare triple {136853#false} assume !false; {136853#false} is VALID [2022-04-15 18:21:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-04-15 18:21:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:21:09,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666836517] [2022-04-15 18:21:09,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666836517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:09,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:09,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:21:09,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221627797] [2022-04-15 18:21:09,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221627797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:09,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166483410] [2022-04-15 18:21:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:21:09,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 194 [2022-04-15 18:21:09,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:21:09,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:10,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:21:10,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:21:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:21:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:21:10,066 INFO L87 Difference]: Start difference. First operand 1164 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:12,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:21:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:13,441 INFO L93 Difference]: Finished difference Result 2841 states and 4135 transitions. [2022-04-15 18:21:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:21:13,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 194 [2022-04-15 18:21:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:21:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:21:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 18:21:13,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 18:21:13,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:21:13,843 INFO L225 Difference]: With dead ends: 2841 [2022-04-15 18:21:13,843 INFO L226 Difference]: Without dead ends: 1693 [2022-04-15 18:21:13,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:21:13,845 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 91 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:21:13,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 288 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:21:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2022-04-15 18:21:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1392. [2022-04-15 18:21:13,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:21:13,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1693 states. Second operand has 1392 states, 1387 states have (on average 1.4837779379956741) internal successors, (2058), 1387 states have internal predecessors, (2058), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:13,938 INFO L74 IsIncluded]: Start isIncluded. First operand 1693 states. Second operand has 1392 states, 1387 states have (on average 1.4837779379956741) internal successors, (2058), 1387 states have internal predecessors, (2058), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:13,939 INFO L87 Difference]: Start difference. First operand 1693 states. Second operand has 1392 states, 1387 states have (on average 1.4837779379956741) internal successors, (2058), 1387 states have internal predecessors, (2058), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:14,013 INFO L93 Difference]: Finished difference Result 1693 states and 2441 transitions. [2022-04-15 18:21:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2441 transitions. [2022-04-15 18:21:14,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:14,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:14,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 1392 states, 1387 states have (on average 1.4837779379956741) internal successors, (2058), 1387 states have internal predecessors, (2058), 3 states have call successors, (3), 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 1693 states. [2022-04-15 18:21:14,017 INFO L87 Difference]: Start difference. First operand has 1392 states, 1387 states have (on average 1.4837779379956741) internal successors, (2058), 1387 states have internal predecessors, (2058), 3 states have call successors, (3), 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 1693 states. [2022-04-15 18:21:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:14,098 INFO L93 Difference]: Finished difference Result 1693 states and 2441 transitions. [2022-04-15 18:21:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2441 transitions. [2022-04-15 18:21:14,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:14,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:14,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:21:14,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:21:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1387 states have (on average 1.4837779379956741) internal successors, (2058), 1387 states have internal predecessors, (2058), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2062 transitions. [2022-04-15 18:21:14,182 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2062 transitions. Word has length 194 [2022-04-15 18:21:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:21:14,183 INFO L478 AbstractCegarLoop]: Abstraction has 1392 states and 2062 transitions. [2022-04-15 18:21:14,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:14,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1392 states and 2062 transitions. [2022-04-15 18:21:16,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2062 edges. 2062 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:21:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2062 transitions. [2022-04-15 18:21:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-15 18:21:16,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:21:16,274 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:21:16,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 18:21:16,274 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:21:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:21:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash 344605487, now seen corresponding path program 1 times [2022-04-15 18:21:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:16,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781163964] [2022-04-15 18:21:42,475 WARN L232 SmtUtils]: Spent 19.23s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:21:51,270 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:21:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 344605487, now seen corresponding path program 2 times [2022-04-15 18:21:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:21:51,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880504896] [2022-04-15 18:21:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:21:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:21:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:21:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:21:51,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {148723#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {148716#true} is VALID [2022-04-15 18:21:51,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {148716#true} assume true; {148716#true} is VALID [2022-04-15 18:21:51,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148716#true} {148716#true} #593#return; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {148716#true} call ULTIMATE.init(); {148723#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {148723#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {148716#true} assume true; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148716#true} {148716#true} #593#return; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {148716#true} call #t~ret158 := main(); {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {148716#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {148716#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {148716#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {148716#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {148716#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {148716#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {148716#true} assume !false; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {148716#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {148716#true} assume 12292 == #t~mem49;havoc #t~mem49; {148716#true} is VALID [2022-04-15 18:21:51,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {148716#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {148716#true} is VALID [2022-04-15 18:21:51,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {148716#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {148716#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {148716#true} is VALID [2022-04-15 18:21:51,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {148716#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {148716#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, 80 + ~s.offset, 8); {148716#true} is VALID [2022-04-15 18:21:51,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {148716#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {148716#true} is VALID [2022-04-15 18:21:51,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {148716#true} assume !(0 == ~tmp___4~0); {148716#true} is VALID [2022-04-15 18:21:51,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {148716#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {148716#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {148716#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {148716#true} ~skip~0 := 0; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {148716#true} assume !false; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {148716#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {148716#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {148716#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {148716#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {148716#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {148716#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {148716#true} assume 4368 == #t~mem54;havoc #t~mem54; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {148716#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {148716#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {148716#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {148716#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {148716#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {148716#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {148716#true} ~skip~0 := 0; {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {148716#true} assume !false; {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {148716#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {148716#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {148716#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {148716#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {148716#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {148716#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {148716#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {148716#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {148716#true} assume 4384 == #t~mem56;havoc #t~mem56; {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {148716#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {148716#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {148716#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {148716#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {148716#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {148716#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {148716#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {148716#true} ~skip~0 := 0; {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {148716#true} assume !false; {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {148716#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {148716#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {148716#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {148716#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {148716#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {148716#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {148716#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {148716#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {148716#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {148716#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {148716#true} assume 4400 == #t~mem58;havoc #t~mem58; {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {148716#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {148716#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {148716#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {148716#true} assume !(~ret~0 <= 0); {148716#true} is VALID [2022-04-15 18:21:51,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {148716#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {148716#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {148716#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {148716#true} ~skip~0 := 0; {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {148716#true} assume !false; {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {148716#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {148716#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {148716#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {148716#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 83: Hoare triple {148716#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {148716#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 85: Hoare triple {148716#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {148716#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 87: Hoare triple {148716#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {148716#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {148716#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {148716#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 91: Hoare triple {148716#true} assume 4416 == #t~mem60;havoc #t~mem60; {148716#true} is VALID [2022-04-15 18:21:51,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {148716#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {148716#true} is VALID [2022-04-15 18:21:51,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {148716#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {148716#true} is VALID [2022-04-15 18:21:51,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {148716#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,466 INFO L290 TraceCheckUtils]: 95: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,466 INFO L290 TraceCheckUtils]: 96: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,466 INFO L290 TraceCheckUtils]: 97: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,467 INFO L290 TraceCheckUtils]: 98: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,467 INFO L290 TraceCheckUtils]: 99: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,467 INFO L290 TraceCheckUtils]: 100: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,468 INFO L290 TraceCheckUtils]: 101: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,468 INFO L290 TraceCheckUtils]: 102: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,468 INFO L290 TraceCheckUtils]: 103: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,468 INFO L290 TraceCheckUtils]: 104: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,470 INFO L290 TraceCheckUtils]: 108: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,470 INFO L290 TraceCheckUtils]: 109: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,470 INFO L290 TraceCheckUtils]: 110: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,471 INFO L290 TraceCheckUtils]: 111: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,471 INFO L290 TraceCheckUtils]: 112: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:21:51,471 INFO L290 TraceCheckUtils]: 113: Hoare triple {148721#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {148722#(= |ssl3_connect_#t~mem62| 4432)} is VALID [2022-04-15 18:21:51,471 INFO L290 TraceCheckUtils]: 114: Hoare triple {148722#(= |ssl3_connect_#t~mem62| 4432)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 115: Hoare triple {148717#false} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 116: Hoare triple {148717#false} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 117: Hoare triple {148717#false} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 118: Hoare triple {148717#false} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 119: Hoare triple {148717#false} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 120: Hoare triple {148717#false} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 121: Hoare triple {148717#false} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 122: Hoare triple {148717#false} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 123: Hoare triple {148717#false} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 124: Hoare triple {148717#false} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 125: Hoare triple {148717#false} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 126: Hoare triple {148717#false} assume !(4512 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 127: Hoare triple {148717#false} assume 4513 == #t~mem75;havoc #t~mem75; {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 128: Hoare triple {148717#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 129: Hoare triple {148717#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 130: Hoare triple {148717#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {148717#false} is VALID [2022-04-15 18:21:51,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {148717#false} assume !(0 == ~tmp___7~0); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 132: Hoare triple {148717#false} assume !(0 == ~tmp___8~0); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 133: Hoare triple {148717#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 134: Hoare triple {148717#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 135: Hoare triple {148717#false} ~skip~0 := 0; {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 136: Hoare triple {148717#false} assume !false; {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 137: Hoare triple {148717#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 138: Hoare triple {148717#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 139: Hoare triple {148717#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 140: Hoare triple {148717#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 141: Hoare triple {148717#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 142: Hoare triple {148717#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 143: Hoare triple {148717#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 144: Hoare triple {148717#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 145: Hoare triple {148717#false} assume 4384 == #t~mem56;havoc #t~mem56; {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 146: Hoare triple {148717#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 147: Hoare triple {148717#false} assume !(1 == ~blastFlag~0); {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 148: Hoare triple {148717#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {148717#false} is VALID [2022-04-15 18:21:51,473 INFO L290 TraceCheckUtils]: 149: Hoare triple {148717#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 150: Hoare triple {148717#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 151: Hoare triple {148717#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 152: Hoare triple {148717#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 153: Hoare triple {148717#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 154: Hoare triple {148717#false} ~skip~0 := 0; {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 155: Hoare triple {148717#false} assume !false; {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 156: Hoare triple {148717#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 157: Hoare triple {148717#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 158: Hoare triple {148717#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 159: Hoare triple {148717#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 160: Hoare triple {148717#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 161: Hoare triple {148717#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 162: Hoare triple {148717#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 163: Hoare triple {148717#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 164: Hoare triple {148717#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 165: Hoare triple {148717#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 166: Hoare triple {148717#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,474 INFO L290 TraceCheckUtils]: 167: Hoare triple {148717#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 168: Hoare triple {148717#false} assume 4416 == #t~mem60;havoc #t~mem60; {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 169: Hoare triple {148717#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 170: Hoare triple {148717#false} assume !(3 == ~blastFlag~0); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 171: Hoare triple {148717#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 172: Hoare triple {148717#false} assume !(0 == ~tmp___6~0); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 173: Hoare triple {148717#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 174: Hoare triple {148717#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 175: Hoare triple {148717#false} ~skip~0 := 0; {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 176: Hoare triple {148717#false} assume !false; {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 177: Hoare triple {148717#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 178: Hoare triple {148717#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 179: Hoare triple {148717#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 180: Hoare triple {148717#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 181: Hoare triple {148717#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 182: Hoare triple {148717#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 183: Hoare triple {148717#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 184: Hoare triple {148717#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 185: Hoare triple {148717#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,475 INFO L290 TraceCheckUtils]: 186: Hoare triple {148717#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 187: Hoare triple {148717#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 188: Hoare triple {148717#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 189: Hoare triple {148717#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 190: Hoare triple {148717#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 191: Hoare triple {148717#false} assume 4432 == #t~mem62;havoc #t~mem62; {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 192: Hoare triple {148717#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 193: Hoare triple {148717#false} assume 5 == ~blastFlag~0; {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L290 TraceCheckUtils]: 194: Hoare triple {148717#false} assume !false; {148717#false} is VALID [2022-04-15 18:21:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-04-15 18:21:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:21:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880504896] [2022-04-15 18:21:51,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880504896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:51,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:51,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:51,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:21:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781163964] [2022-04-15 18:21:51,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781163964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:21:51,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:21:51,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:21:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458762561] [2022-04-15 18:21:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:21:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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 195 [2022-04-15 18:21:51,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:21:51,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:51,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:21:51,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:21:51,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:21:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:21:51,564 INFO L87 Difference]: Start difference. First operand 1392 states and 2062 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:53,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:21:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:54,781 INFO L93 Difference]: Finished difference Result 2800 states and 4137 transitions. [2022-04-15 18:21:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:21:54,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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 195 [2022-04-15 18:21:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:21:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-15 18:21:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-15 18:21:54,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-04-15 18:21:54,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:21:55,061 INFO L225 Difference]: With dead ends: 2800 [2022-04-15 18:21:55,061 INFO L226 Difference]: Without dead ends: 1424 [2022-04-15 18:21:55,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:21:55,063 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 19 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:21:55,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 460 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:21:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-04-15 18:21:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1392. [2022-04-15 18:21:55,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:21:55,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1424 states. Second operand has 1392 states, 1387 states have (on average 1.4801730353280462) internal successors, (2053), 1387 states have internal predecessors, (2053), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:55,169 INFO L74 IsIncluded]: Start isIncluded. First operand 1424 states. Second operand has 1392 states, 1387 states have (on average 1.4801730353280462) internal successors, (2053), 1387 states have internal predecessors, (2053), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:55,169 INFO L87 Difference]: Start difference. First operand 1424 states. Second operand has 1392 states, 1387 states have (on average 1.4801730353280462) internal successors, (2053), 1387 states have internal predecessors, (2053), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:55,220 INFO L93 Difference]: Finished difference Result 1424 states and 2090 transitions. [2022-04-15 18:21:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2090 transitions. [2022-04-15 18:21:55,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:55,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:55,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 1392 states, 1387 states have (on average 1.4801730353280462) internal successors, (2053), 1387 states have internal predecessors, (2053), 3 states have call successors, (3), 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 1424 states. [2022-04-15 18:21:55,224 INFO L87 Difference]: Start difference. First operand has 1392 states, 1387 states have (on average 1.4801730353280462) internal successors, (2053), 1387 states have internal predecessors, (2053), 3 states have call successors, (3), 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 1424 states. [2022-04-15 18:21:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:21:55,275 INFO L93 Difference]: Finished difference Result 1424 states and 2090 transitions. [2022-04-15 18:21:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2090 transitions. [2022-04-15 18:21:55,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:21:55,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:21:55,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:21:55,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:21:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1387 states have (on average 1.4801730353280462) internal successors, (2053), 1387 states have internal predecessors, (2053), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2057 transitions. [2022-04-15 18:21:55,350 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2057 transitions. Word has length 195 [2022-04-15 18:21:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:21:55,350 INFO L478 AbstractCegarLoop]: Abstraction has 1392 states and 2057 transitions. [2022-04-15 18:21:55,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:21:55,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1392 states and 2057 transitions. [2022-04-15 18:21:57,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2057 edges. 2057 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:21:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2057 transitions. [2022-04-15 18:21:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-15 18:21:57,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:21:57,193 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:21:57,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 18:21:57,194 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:21:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:21:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1615105868, now seen corresponding path program 1 times [2022-04-15 18:21:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:21:57,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [289057716] [2022-04-15 18:22:13,120 WARN L232 SmtUtils]: Spent 10.53s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:22:21,876 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:22:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1615105868, now seen corresponding path program 2 times [2022-04-15 18:22:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:22:21,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122369703] [2022-04-15 18:22:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:22:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:22:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:22:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:22,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {159970#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {159960#true} is VALID [2022-04-15 18:22:22,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {159960#true} assume true; {159960#true} is VALID [2022-04-15 18:22:22,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159960#true} {159960#true} #593#return; {159960#true} is VALID [2022-04-15 18:22:22,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {159960#true} call ULTIMATE.init(); {159970#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:22:22,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {159970#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {159960#true} assume true; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159960#true} {159960#true} #593#return; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {159960#true} call #t~ret158 := main(); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {159960#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {159960#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {159960#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 -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {159960#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {159960#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {159960#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {159960#true} assume 12292 == #t~mem49;havoc #t~mem49; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {159960#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {159960#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {159960#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {159960#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {159960#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, 80 + ~s.offset, 8); {159960#true} is VALID [2022-04-15 18:22:22,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {159960#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {159960#true} assume !(0 == ~tmp___4~0); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {159960#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {159960#true} assume 4368 == #t~mem54;havoc #t~mem54; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {159960#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {159960#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {159960#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {159960#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {159960#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {159960#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {159960#true} assume 4384 == #t~mem56;havoc #t~mem56; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {159960#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {159960#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {159960#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {159960#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {159960#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 63: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 64: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {159960#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {159960#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 67: Hoare triple {159960#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 68: Hoare triple {159960#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {159960#true} assume 4400 == #t~mem58;havoc #t~mem58; {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {159960#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {159960#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);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; {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {159960#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {159960#true} assume !(~ret~0 <= 0); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {159960#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 79: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 80: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {159960#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {159960#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {159960#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {159960#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159965#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 89: Hoare triple {159965#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159966#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 90: Hoare triple {159966#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159967#(not (= |ssl3_connect_#t~mem60| 4400))} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 91: Hoare triple {159967#(not (= |ssl3_connect_#t~mem60| 4400))} assume 4416 == #t~mem60;havoc #t~mem60; {159960#true} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 92: Hoare triple {159960#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {159960#true} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 93: Hoare triple {159960#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {159960#true} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {159960#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {159960#true} assume !(0 == ~tmp___6~0); {159960#true} is VALID [2022-04-15 18:22:22,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 98: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 99: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 100: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 101: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 102: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 103: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 104: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 105: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 106: Hoare triple {159960#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 107: Hoare triple {159960#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 108: Hoare triple {159960#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 109: Hoare triple {159960#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {159960#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 111: Hoare triple {159960#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 112: Hoare triple {159960#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 113: Hoare triple {159960#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 114: Hoare triple {159960#true} assume 4432 == #t~mem62;havoc #t~mem62; {159960#true} is VALID [2022-04-15 18:22:22,146 INFO L290 TraceCheckUtils]: 115: Hoare triple {159960#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 116: Hoare triple {159960#true} assume !(5 == ~blastFlag~0); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 117: Hoare triple {159960#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 118: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 119: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 120: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 121: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 122: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 123: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 124: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 125: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 126: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 127: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 128: Hoare triple {159960#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 129: Hoare triple {159960#true} assume 4369 == #t~mem55;havoc #t~mem55; {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 130: Hoare triple {159960#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 131: Hoare triple {159960#true} assume !(0 == ~blastFlag~0); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 132: Hoare triple {159960#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {159960#true} is VALID [2022-04-15 18:22:22,147 INFO L290 TraceCheckUtils]: 133: Hoare triple {159960#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 134: Hoare triple {159960#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 135: Hoare triple {159960#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 136: Hoare triple {159960#true} ~skip~0 := 0; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 137: Hoare triple {159960#true} assume !false; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 138: Hoare triple {159960#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 139: Hoare triple {159960#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 140: Hoare triple {159960#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 141: Hoare triple {159960#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 142: Hoare triple {159960#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 143: Hoare triple {159960#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 144: Hoare triple {159960#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 145: Hoare triple {159960#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 146: Hoare triple {159960#true} assume 4384 == #t~mem56;havoc #t~mem56; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 147: Hoare triple {159960#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 148: Hoare triple {159960#true} assume !(1 == ~blastFlag~0); {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 149: Hoare triple {159960#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {159960#true} is VALID [2022-04-15 18:22:22,148 INFO L290 TraceCheckUtils]: 150: Hoare triple {159960#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {159960#true} is VALID [2022-04-15 18:22:22,149 INFO L290 TraceCheckUtils]: 151: Hoare triple {159960#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,150 INFO L290 TraceCheckUtils]: 152: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,150 INFO L290 TraceCheckUtils]: 153: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,150 INFO L290 TraceCheckUtils]: 154: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,150 INFO L290 TraceCheckUtils]: 155: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} ~skip~0 := 0; {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,151 INFO L290 TraceCheckUtils]: 156: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !false; {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,151 INFO L290 TraceCheckUtils]: 157: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,151 INFO L290 TraceCheckUtils]: 158: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,151 INFO L290 TraceCheckUtils]: 159: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,152 INFO L290 TraceCheckUtils]: 160: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,152 INFO L290 TraceCheckUtils]: 161: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,152 INFO L290 TraceCheckUtils]: 162: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,152 INFO L290 TraceCheckUtils]: 163: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,152 INFO L290 TraceCheckUtils]: 164: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,153 INFO L290 TraceCheckUtils]: 165: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,153 INFO L290 TraceCheckUtils]: 166: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,153 INFO L290 TraceCheckUtils]: 167: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 168: Hoare triple {159968#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159969#(not (= |ssl3_connect_#t~mem60| 4416))} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 169: Hoare triple {159969#(not (= |ssl3_connect_#t~mem60| 4416))} assume 4416 == #t~mem60;havoc #t~mem60; {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 170: Hoare triple {159961#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 171: Hoare triple {159961#false} assume !(3 == ~blastFlag~0); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 172: Hoare triple {159961#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 173: Hoare triple {159961#false} assume !(0 == ~tmp___6~0); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 174: Hoare triple {159961#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 175: Hoare triple {159961#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 176: Hoare triple {159961#false} ~skip~0 := 0; {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 177: Hoare triple {159961#false} assume !false; {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 178: Hoare triple {159961#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 179: Hoare triple {159961#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 180: Hoare triple {159961#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 181: Hoare triple {159961#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,154 INFO L290 TraceCheckUtils]: 182: Hoare triple {159961#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 183: Hoare triple {159961#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 184: Hoare triple {159961#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 185: Hoare triple {159961#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 186: Hoare triple {159961#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 187: Hoare triple {159961#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 188: Hoare triple {159961#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 189: Hoare triple {159961#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 190: Hoare triple {159961#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 191: Hoare triple {159961#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 192: Hoare triple {159961#false} assume 4432 == #t~mem62;havoc #t~mem62; {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 193: Hoare triple {159961#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 194: Hoare triple {159961#false} assume 5 == ~blastFlag~0; {159961#false} is VALID [2022-04-15 18:22:22,155 INFO L290 TraceCheckUtils]: 195: Hoare triple {159961#false} assume !false; {159961#false} is VALID [2022-04-15 18:22:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 226 proven. 6 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 18:22:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:22:22,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122369703] [2022-04-15 18:22:22,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122369703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 18:22:22,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947538403] [2022-04-15 18:22:22,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 18:22:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 18:22:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:22:22,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 18:22:22,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 18:22:57,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 18:22:57,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 18:22:57,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 18:22:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:57,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 18:22:57,820 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 18:22:57,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 18:22:57,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 18:22:57,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 18:22:57,834 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