/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:30:17,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:30:17,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:30:17,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:30:17,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:30:17,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:30:17,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:30:17,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:30:17,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:30:17,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:30:17,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:30:17,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:30:17,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:30:17,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:30:17,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:30:17,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:30:17,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:30:17,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:30:17,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:30:17,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:30:17,530 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:30:17,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:30:17,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:30:17,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:30:17,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:30:17,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:30:17,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:30:17,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:30:17,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:30:17,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:30:17,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:30:17,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:30:17,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:30:17,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:30:17,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:30:17,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:30:17,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:30:17,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:30:17,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:30:17,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:30:17,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:30:17,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:30:17,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:30:17,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:30:17,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:30:17,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:30:17,556 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:30:17,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:30:17,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:30:17,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:30:17,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:30:17,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:30:17,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:30:17,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:30:17,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:30:17,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:30:17,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:30:17,559 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:30:17,559 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:30:17,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:30:17,559 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:30:17,559 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-28 08:30:17,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:30:17,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:30:17,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:30:17,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:30:17,732 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:30:17,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-28 08:30:17,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd40918a9/98918e0766df4ad2b2bbdfc07d2e33b6/FLAG129571a3c [2022-04-28 08:30:18,231 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:30:18,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-28 08:30:18,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd40918a9/98918e0766df4ad2b2bbdfc07d2e33b6/FLAG129571a3c [2022-04-28 08:30:18,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd40918a9/98918e0766df4ad2b2bbdfc07d2e33b6 [2022-04-28 08:30:18,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:30:18,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:30:18,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:30:18,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:30:18,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:30:18,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eaebaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18, skipping insertion in model container [2022-04-28 08:30:18,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:30:18,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:30:18,637 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.01.i.cil-1.c[65523,65536] [2022-04-28 08:30:18,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:30:18,660 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:30:18,729 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.01.i.cil-1.c[65523,65536] [2022-04-28 08:30:18,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:30:18,744 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:30:18,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18 WrapperNode [2022-04-28 08:30:18,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:30:18,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:30:18,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:30:18,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:30:18,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:30:18,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:30:18,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:30:18,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:30:18,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (1/1) ... [2022-04-28 08:30:18,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:30:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:30:18,906 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-28 08:30:18,913 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-28 08:30:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:30:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:30:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:30:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 08:30:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 08:30:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:30:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 08:30:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:30:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:30:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:30:18,942 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:30:18,943 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:30:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:30:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:30:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:30:18,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:30:18,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:30:19,106 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:30:19,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:30:20,559 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:30:21,057 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 08:30:21,057 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 08:30:21,078 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:30:21,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:30:21,084 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:30:21,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:30:21 BoogieIcfgContainer [2022-04-28 08:30:21,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:30:21,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:30:21,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:30:21,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:30:21,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:30:18" (1/3) ... [2022-04-28 08:30:21,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449429ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:30:21, skipping insertion in model container [2022-04-28 08:30:21,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:30:18" (2/3) ... [2022-04-28 08:30:21,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449429ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:30:21, skipping insertion in model container [2022-04-28 08:30:21,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:30:21" (3/3) ... [2022-04-28 08:30:21,097 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2022-04-28 08:30:21,109 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:30:21,109 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:30:21,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:30:21,168 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e0e8f71, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e25d555 [2022-04-28 08:30:21,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:30:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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-28 08:30:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:30:21,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:30:21,198 INFO L195 NwaCegarLoop]: 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-28 08:30:21,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:30:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:30:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 1 times [2022-04-28 08:30:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:21,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1746358923] [2022-04-28 08:30:21,214 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:30:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 2 times [2022-04-28 08:30:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:30:21,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500777359] [2022-04-28 08:30:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:30:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:30:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:30:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:21,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-28 08:30:21,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 08:30:21,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-28 08:30:21,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:30:21,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-28 08:30:21,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 08:30:21,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-28 08:30:21,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-28 08:30:21,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {143#true} is VALID [2022-04-28 08:30:21,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-28 08:30:21,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:21,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:21,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:21,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:21,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:21,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {149#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-28 08:30:21,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {144#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {144#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {144#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {144#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {144#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {144#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {144#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {144#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {144#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {144#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {144#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {144#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {144#false} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-28 08:30:21,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-28 08:30:21,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-28 08:30:21,777 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-28 08:30:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:30:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500777359] [2022-04-28 08:30:21,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500777359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:21,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:21,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:30:21,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:30:21,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1746358923] [2022-04-28 08:30:21,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1746358923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:21,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:21,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:30:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449515662] [2022-04-28 08:30:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:30:21,788 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-28 08:30:21,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:30:21,792 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-28 08:30:21,823 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-28 08:30:21,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:30:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:30:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:30:21,846 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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-28 08:30:23,889 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-28 08:30:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:24,977 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-04-28 08:30:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:30:24,978 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-28 08:30:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:30:24,979 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-28 08:30:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-28 08:30:24,989 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-28 08:30:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-28 08:30:24,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-28 08:30:25,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:25,299 INFO L225 Difference]: With dead ends: 271 [2022-04-28 08:30:25,299 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 08:30:25,302 INFO L412 NwaCegarLoop]: 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-28 08:30:25,305 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:30:25,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:30:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 08:30:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-28 08:30:25,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:30:25,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:25,333 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:25,333 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:25,338 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-28 08:30:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-28 08:30:25,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:25,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:25,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 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 124 states. [2022-04-28 08:30:25,340 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 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 124 states. [2022-04-28 08:30:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:25,344 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-28 08:30:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-28 08:30:25,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:25,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:25,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:30:25,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:30:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-04-28 08:30:25,350 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-04-28 08:30:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:30:25,350 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-04-28 08:30:25,350 INFO L496 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-28 08:30:25,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 180 transitions. [2022-04-28 08:30:25,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-04-28 08:30:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 08:30:25,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:30:25,470 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 08:30:25,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:30:25,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:30:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:30:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -541033565, now seen corresponding path program 1 times [2022-04-28 08:30:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:25,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442831037] [2022-04-28 08:30:25,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:30:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -541033565, now seen corresponding path program 2 times [2022-04-28 08:30:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:30:25,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719175088] [2022-04-28 08:30:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:30:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:30:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:30:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:25,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {1197#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1191#true} is VALID [2022-04-28 08:30:25,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 08:30:25,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #592#return; {1191#true} is VALID [2022-04-28 08:30:25,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1197#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:30:25,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1191#true} is VALID [2022-04-28 08:30:25,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 08:30:25,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #592#return; {1191#true} is VALID [2022-04-28 08:30:25,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret159 := main(); {1191#true} is VALID [2022-04-28 08:30:25,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1191#true} is VALID [2022-04-28 08:30:25,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1191#true} is VALID [2022-04-28 08:30:25,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#(= 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)))); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 08:30:25,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1192#false} is VALID [2022-04-28 08:30:25,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-28 08:30:25,690 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-28 08:30:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:30:25,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719175088] [2022-04-28 08:30:25,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719175088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:25,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:25,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:30:25,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:30:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442831037] [2022-04-28 08:30:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442831037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:25,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:25,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:30:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040520974] [2022-04-28 08:30:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:30:25,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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 45 [2022-04-28 08:30:25,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:30:25,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:25,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:25,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:30:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:25,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:30:25,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:30:25,731 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:27,753 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-28 08:30:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:28,383 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-04-28 08:30:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:30:28,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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 45 [2022-04-28 08:30:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:30:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-28 08:30:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-28 08:30:28,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-28 08:30:28,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:28,728 INFO L225 Difference]: With dead ends: 333 [2022-04-28 08:30:28,728 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 08:30:28,729 INFO L412 NwaCegarLoop]: 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-28 08:30:28,730 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:30:28,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:30:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 08:30:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-04-28 08:30:28,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:30:28,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,742 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,742 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:28,749 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-28 08:30:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-28 08:30:28,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:28,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:28,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 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 226 states. [2022-04-28 08:30:28,751 INFO L87 Difference]: Start difference. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 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 226 states. [2022-04-28 08:30:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:28,757 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-28 08:30:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-28 08:30:28,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:28,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:28,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:30:28,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:30:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-04-28 08:30:28,766 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-04-28 08:30:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:30:28,767 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-04-28 08:30:28,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:28,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 330 transitions. [2022-04-28 08:30:28,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-28 08:30:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 08:30:28,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:30:28,985 INFO L195 NwaCegarLoop]: 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-28 08:30:28,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:30:28,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:30:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:30:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash -391559510, now seen corresponding path program 1 times [2022-04-28 08:30:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:28,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570006978] [2022-04-28 08:30:28,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:30:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -391559510, now seen corresponding path program 2 times [2022-04-28 08:30:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:30:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91266703] [2022-04-28 08:30:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:30:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:30:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:30:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:29,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2770#true} is VALID [2022-04-28 08:30:29,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-28 08:30:29,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2770#true} {2770#true} #592#return; {2770#true} is VALID [2022-04-28 08:30:29,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2777#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:30:29,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2770#true} is VALID [2022-04-28 08:30:29,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-28 08:30:29,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #592#return; {2770#true} is VALID [2022-04-28 08:30:29,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret159 := main(); {2770#true} is VALID [2022-04-28 08:30:29,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2770#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {2770#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {2770#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {2770#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {2770#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {2770#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-28 08:30:29,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {2770#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#true} assume 12292 == #t~mem43;havoc #t~mem43; {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {2770#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {2770#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {2770#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {2770#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {2770#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {2770#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {2770#true} is VALID [2022-04-28 08:30:29,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {2770#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {2770#true} is VALID [2022-04-28 08:30:29,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {2770#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {2770#true} is VALID [2022-04-28 08:30:29,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {2770#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {2770#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {2770#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2770#true} is VALID [2022-04-28 08:30:29,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {2770#true} ~skip~0 := 0; {2770#true} is VALID [2022-04-28 08:30:29,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-28 08:30:29,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {2770#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {2770#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {2770#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {2770#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {2770#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {2770#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-28 08:30:29,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {2770#true} assume 4368 == #t~mem48;havoc #t~mem48; {2770#true} is VALID [2022-04-28 08:30:29,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {2770#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {2770#true} is VALID [2022-04-28 08:30:29,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {2770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2770#true} is VALID [2022-04-28 08:30:29,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {2770#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:30:29,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2776#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-28 08:30:29,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {2776#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-28 08:30:29,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {2771#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-28 08:30:29,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {2771#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-28 08:30:29,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {2771#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-28 08:30:29,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {2771#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-28 08:30:29,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {2771#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-28 08:30:29,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {2771#false} assume 4432 == #t~mem56;havoc #t~mem56; {2771#false} is VALID [2022-04-28 08:30:29,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {2771#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2771#false} is VALID [2022-04-28 08:30:29,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {2771#false} assume 5 == ~blastFlag~0; {2771#false} is VALID [2022-04-28 08:30:29,246 INFO L290 TraceCheckUtils]: 59: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2022-04-28 08:30:29,247 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-28 08:30:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:30:29,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91266703] [2022-04-28 08:30:29,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91266703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:29,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:29,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:30:29,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:30:29,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570006978] [2022-04-28 08:30:29,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570006978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:29,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:29,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:30:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475850085] [2022-04-28 08:30:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:30:29,252 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-28 08:30:29,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:30:29,253 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-28 08:30:29,296 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-28 08:30:29,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:30:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:30:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:30:29,297 INFO L87 Difference]: Start difference. First operand 226 states and 330 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-28 08:30:31,321 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-28 08:30:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:32,347 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-04-28 08:30:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:30:32,348 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-28 08:30:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:30:32,348 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-28 08:30:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-28 08:30:32,351 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-28 08:30:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-28 08:30:32,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-28 08:30:32,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:32,595 INFO L225 Difference]: With dead ends: 368 [2022-04-28 08:30:32,595 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 08:30:32,595 INFO L412 NwaCegarLoop]: 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-28 08:30:32,596 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:30:32,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:30:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 08:30:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-04-28 08:30:32,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:30:32,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:32,607 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:32,607 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:32,620 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-28 08:30:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-28 08:30:32,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:32,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:32,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 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 261 states. [2022-04-28 08:30:32,622 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 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 261 states. [2022-04-28 08:30:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:32,627 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-28 08:30:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-28 08:30:32,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:32,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:32,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:30:32,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:30:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-04-28 08:30:32,634 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-04-28 08:30:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:30:32,634 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-04-28 08:30:32,635 INFO L496 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-28 08:30:32,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 360 transitions. [2022-04-28 08:30:32,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-04-28 08:30:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 08:30:32,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:30:32,888 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-04-28 08:30:32,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:30:32,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:30:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:30:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -63404668, now seen corresponding path program 3 times [2022-04-28 08:30:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:32,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535081993] [2022-04-28 08:30:44,079 WARN L232 SmtUtils]: Spent 11.18s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:30:53,791 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:30:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -63404668, now seen corresponding path program 4 times [2022-04-28 08:30:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:30:53,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650533881] [2022-04-28 08:30:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:30:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:30:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:30:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:30:53,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {4535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4528#true} is VALID [2022-04-28 08:30:53,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-28 08:30:53,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4528#true} {4528#true} #592#return; {4528#true} is VALID [2022-04-28 08:30:53,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {4528#true} call ULTIMATE.init(); {4535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:30:53,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4528#true} {4528#true} #592#return; {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {4528#true} call #t~ret159 := main(); {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {4528#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {4528#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {4528#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {4528#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {4528#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {4528#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4528#true} is VALID [2022-04-28 08:30:53,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {4528#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {4528#true} assume 12292 == #t~mem43;havoc #t~mem43; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {4528#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {4528#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {4528#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {4528#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {4528#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {4528#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {4528#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {4528#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4528#true} is VALID [2022-04-28 08:30:53,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {4528#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {4528#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {4528#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {4528#true} ~skip~0 := 0; {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {4528#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {4528#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {4528#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {4528#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {4528#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {4528#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#true} assume 4368 == #t~mem48;havoc #t~mem48; {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {4528#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {4528#true} is VALID [2022-04-28 08:30:53,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {4528#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4528#true} is VALID [2022-04-28 08:30:53,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {4528#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:30:53,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:30:53,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:30:53,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:30:53,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:30:53,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:30:53,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4534#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {4534#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {4529#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {4529#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {4529#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {4529#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {4529#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {4529#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {4529#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4529#false} is VALID [2022-04-28 08:30:53,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {4529#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4529#false} is VALID [2022-04-28 08:30:53,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {4529#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {4529#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {4529#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4529#false} is VALID [2022-04-28 08:30:53,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {4529#false} ~skip~0 := 0; {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 57: Hoare triple {4529#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {4529#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 59: Hoare triple {4529#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {4529#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 61: Hoare triple {4529#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 62: Hoare triple {4529#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {4529#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {4529#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {4529#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {4529#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {4529#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {4529#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {4529#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {4529#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {4529#false} assume 4432 == #t~mem56;havoc #t~mem56; {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {4529#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {4529#false} assume 5 == ~blastFlag~0; {4529#false} is VALID [2022-04-28 08:30:53,988 INFO L290 TraceCheckUtils]: 74: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-28 08:30:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:30:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:30:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650533881] [2022-04-28 08:30:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650533881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:53,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:53,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:30:53,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:30:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535081993] [2022-04-28 08:30:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535081993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:30:53,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:30:53,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:30:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625255617] [2022-04-28 08:30:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:30:53,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:30:53,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:30:53,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:54,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:54,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:30:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:30:54,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:30:54,051 INFO L87 Difference]: Start difference. First operand 244 states and 360 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:56,079 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-28 08:30:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:57,046 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2022-04-28 08:30:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:30:57,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:30:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:30:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 08:30:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 08:30:57,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 08:30:57,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:57,367 INFO L225 Difference]: With dead ends: 655 [2022-04-28 08:30:57,367 INFO L226 Difference]: Without dead ends: 427 [2022-04-28 08:30:57,368 INFO L412 NwaCegarLoop]: 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-28 08:30:57,369 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 302 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-28 08:30:57,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:30:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-28 08:30:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 266. [2022-04-28 08:30:57,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:30:57,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,386 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,386 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:57,395 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-28 08:30:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-28 08:30:57,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:57,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:57,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 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 427 states. [2022-04-28 08:30:57,397 INFO L87 Difference]: Start difference. First operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 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 427 states. [2022-04-28 08:30:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:30:57,406 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-28 08:30:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-28 08:30:57,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:30:57,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:30:57,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:30:57,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:30:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2022-04-28 08:30:57,413 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 75 [2022-04-28 08:30:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:30:57,414 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2022-04-28 08:30:57,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:30:57,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 391 transitions. [2022-04-28 08:30:57,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2022-04-28 08:30:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 08:30:57,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:30:57,710 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-04-28 08:30:57,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:30:57,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:30:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:30:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -82060126, now seen corresponding path program 1 times [2022-04-28 08:30:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:30:57,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [809879051] [2022-04-28 08:31:15,470 WARN L232 SmtUtils]: Spent 11.89s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:31:24,678 WARN L232 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:31:25,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:31:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash -82060126, now seen corresponding path program 2 times [2022-04-28 08:31:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:31:25,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844661022] [2022-04-28 08:31:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:31:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:31:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:31:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:25,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {7243#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7236#true} is VALID [2022-04-28 08:31:25,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-28 08:31:25,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7236#true} {7236#true} #592#return; {7236#true} is VALID [2022-04-28 08:31:25,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {7236#true} call ULTIMATE.init(); {7243#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:31:25,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {7243#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7236#true} is VALID [2022-04-28 08:31:25,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-28 08:31:25,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7236#true} {7236#true} #592#return; {7236#true} is VALID [2022-04-28 08:31:25,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {7236#true} call #t~ret159 := main(); {7236#true} is VALID [2022-04-28 08:31:25,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {7236#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7236#true} is VALID [2022-04-28 08:31:25,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {7236#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {7236#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {7236#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {7236#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {7236#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {7236#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {7236#true} assume 12292 == #t~mem43;havoc #t~mem43; {7236#true} is VALID [2022-04-28 08:31:25,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {7236#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {7236#true} is VALID [2022-04-28 08:31:25,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {7236#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {7236#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7236#true} is VALID [2022-04-28 08:31:25,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {7236#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {7236#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {7236#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7236#true} is VALID [2022-04-28 08:31:25,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {7236#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7236#true} is VALID [2022-04-28 08:31:25,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {7236#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7236#true} is VALID [2022-04-28 08:31:25,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {7236#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {7236#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {7236#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7236#true} is VALID [2022-04-28 08:31:25,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {7236#true} ~skip~0 := 0; {7236#true} is VALID [2022-04-28 08:31:25,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-28 08:31:25,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {7236#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {7236#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {7236#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {7236#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {7236#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {7236#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-28 08:31:25,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {7236#true} assume 4368 == #t~mem48;havoc #t~mem48; {7236#true} is VALID [2022-04-28 08:31:25,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {7236#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7236#true} is VALID [2022-04-28 08:31:25,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {7236#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7236#true} is VALID [2022-04-28 08:31:25,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {7236#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:31:25,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7242#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {7242#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {7237#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {7237#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {7237#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {7237#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {7237#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {7237#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {7237#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7237#false} is VALID [2022-04-28 08:31:25,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {7237#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {7237#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {7237#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {7237#false} ~skip~0 := 0; {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {7237#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {7237#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {7237#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {7237#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {7237#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 62: Hoare triple {7237#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 63: Hoare triple {7237#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 64: Hoare triple {7237#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {7237#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {7237#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {7237#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {7237#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {7237#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {7237#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-28 08:31:25,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {7237#false} assume 4432 == #t~mem56;havoc #t~mem56; {7237#false} is VALID [2022-04-28 08:31:25,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {7237#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7237#false} is VALID [2022-04-28 08:31:25,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {7237#false} assume 5 == ~blastFlag~0; {7237#false} is VALID [2022-04-28 08:31:25,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-28 08:31:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:31:25,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:31:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844661022] [2022-04-28 08:31:25,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844661022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:25,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:25,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:31:25,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:31:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [809879051] [2022-04-28 08:31:25,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [809879051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:25,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:25,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:31:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532047940] [2022-04-28 08:31:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:31:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:31:25,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:31:25,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:25,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:25,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:31:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:25,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:31:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:31:25,722 INFO L87 Difference]: Start difference. First operand 266 states and 391 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:27,747 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-28 08:31:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:28,728 INFO L93 Difference]: Finished difference Result 678 states and 1005 transitions. [2022-04-28 08:31:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:31:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 08:31:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:31:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:31:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:31:28,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 08:31:29,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:29,084 INFO L225 Difference]: With dead ends: 678 [2022-04-28 08:31:29,084 INFO L226 Difference]: Without dead ends: 428 [2022-04-28 08:31:29,085 INFO L412 NwaCegarLoop]: 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-28 08:31:29,085 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 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-28 08:31:29,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:31:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-28 08:31:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2022-04-28 08:31:29,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:31:29,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:29,098 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:29,099 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:29,123 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-28 08:31:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-28 08:31:29,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:29,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:29,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 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 428 states. [2022-04-28 08:31:29,124 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 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 428 states. [2022-04-28 08:31:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:29,133 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-28 08:31:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-28 08:31:29,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:29,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:29,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:31:29,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:31:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-04-28 08:31:29,139 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 75 [2022-04-28 08:31:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:31:29,139 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-04-28 08:31:29,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:29,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 392 transitions. [2022-04-28 08:31:29,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-04-28 08:31:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 08:31:29,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:31:29,466 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:31:29,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:31:29,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:31:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:31:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2070296643, now seen corresponding path program 1 times [2022-04-28 08:31:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:29,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996917881] [2022-04-28 08:31:46,309 WARN L232 SmtUtils]: Spent 11.56s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:31:56,607 WARN L232 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:31:57,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:31:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2070296643, now seen corresponding path program 2 times [2022-04-28 08:31:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:31:57,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861961263] [2022-04-28 08:31:57,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:31:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:31:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:57,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:31:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:57,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {10003#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9996#true} is VALID [2022-04-28 08:31:57,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-28 08:31:57,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9996#true} {9996#true} #592#return; {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {9996#true} call ULTIMATE.init(); {10003#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:31:57,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {10003#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9996#true} {9996#true} #592#return; {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {9996#true} call #t~ret159 := main(); {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {9996#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {9996#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {9996#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {9996#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {9996#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {9996#true} is VALID [2022-04-28 08:31:57,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {9996#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {9996#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {9996#true} assume 12292 == #t~mem43;havoc #t~mem43; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {9996#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {9996#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {9996#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {9996#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {9996#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {9996#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {9996#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {9996#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {9996#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {9996#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {9996#true} ~skip~0 := 0; {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {9996#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {9996#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {9996#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {9996#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {9996#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {9996#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {9996#true} assume 4368 == #t~mem48;havoc #t~mem48; {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {9996#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {9996#true} is VALID [2022-04-28 08:31:57,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {9996#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9996#true} is VALID [2022-04-28 08:31:57,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {9996#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:31:57,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {10002#(= |ssl3_connect_#t~mem45| 4384)} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {10002#(= |ssl3_connect_#t~mem45| 4384)} assume 4096 == #t~mem45;havoc #t~mem45; {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {9997#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {9997#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {9997#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {9997#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {9997#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {9997#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {9997#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9997#false} is VALID [2022-04-28 08:31:57,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {9997#false} ~skip~0 := 0; {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {9997#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {9997#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {9997#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {9997#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {9997#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {9997#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {9997#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {9997#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-28 08:31:57,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {9997#false} assume 4432 == #t~mem56;havoc #t~mem56; {9997#false} is VALID [2022-04-28 08:31:57,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {9997#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {9997#false} is VALID [2022-04-28 08:31:57,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {9997#false} assume 5 == ~blastFlag~0; {9997#false} is VALID [2022-04-28 08:31:57,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-28 08:31:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:31:57,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:31:57,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861961263] [2022-04-28 08:31:57,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861961263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:57,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:57,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:31:57,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:31:57,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996917881] [2022-04-28 08:31:57,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996917881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:57,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:57,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:31:57,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491805477] [2022-04-28 08:31:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:31:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 08:31:57,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:31:57,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:57,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:57,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:31:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:31:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:31:57,567 INFO L87 Difference]: Start difference. First operand 268 states and 392 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:31:59,588 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-28 08:32:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:00,530 INFO L93 Difference]: Finished difference Result 421 states and 618 transitions. [2022-04-28 08:32:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:32:00,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 08:32:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-28 08:32:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-28 08:32:00,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-28 08:32:00,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:00,791 INFO L225 Difference]: With dead ends: 421 [2022-04-28 08:32:00,791 INFO L226 Difference]: Without dead ends: 284 [2022-04-28 08:32:00,792 INFO L412 NwaCegarLoop]: 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-28 08:32:00,792 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:00,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:32:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-28 08:32:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-28 08:32:00,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:00,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,807 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,807 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:00,812 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-28 08:32:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-28 08:32:00,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:00,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:00,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 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 284 states. [2022-04-28 08:32:00,813 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 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 284 states. [2022-04-28 08:32:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:00,818 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-28 08:32:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-28 08:32:00,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:00,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:00,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:00,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 391 transitions. [2022-04-28 08:32:00,823 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 391 transitions. Word has length 76 [2022-04-28 08:32:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:00,824 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 391 transitions. [2022-04-28 08:32:00,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:00,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 391 transitions. [2022-04-28 08:32:01,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 391 transitions. [2022-04-28 08:32:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 08:32:01,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:01,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:01,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:32:01,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1822086841, now seen corresponding path program 1 times [2022-04-28 08:32:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:01,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207049196] [2022-04-28 08:32:20,778 WARN L232 SmtUtils]: Spent 14.39s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:32:31,223 WARN L232 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:32:31,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:32:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1822086841, now seen corresponding path program 2 times [2022-04-28 08:32:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:31,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219111520] [2022-04-28 08:32:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:32,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {11961#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11954#true} is VALID [2022-04-28 08:32:32,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-28 08:32:32,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11954#true} {11954#true} #592#return; {11954#true} is VALID [2022-04-28 08:32:32,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {11954#true} call ULTIMATE.init(); {11961#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:32:32,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {11961#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11954#true} {11954#true} #592#return; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {11954#true} call #t~ret159 := main(); {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {11954#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {11954#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {11954#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {11954#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {11954#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {11954#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {11954#true} assume 12292 == #t~mem43;havoc #t~mem43; {11954#true} is VALID [2022-04-28 08:32:32,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {11954#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {11954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {11954#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {11954#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {11954#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {11954#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {11954#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {11954#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {11954#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {11954#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {11954#true} ~skip~0 := 0; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {11954#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {11954#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {11954#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {11954#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {11954#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {11954#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-28 08:32:32,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {11954#true} assume 4368 == #t~mem48;havoc #t~mem48; {11954#true} is VALID [2022-04-28 08:32:32,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {11954#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11954#true} is VALID [2022-04-28 08:32:32,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {11954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11954#true} is VALID [2022-04-28 08:32:32,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {11954#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:32:32,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11960#(= |ssl3_connect_#t~mem46| 4384)} is VALID [2022-04-28 08:32:32,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {11960#(= |ssl3_connect_#t~mem46| 4384)} assume 20480 == #t~mem46;havoc #t~mem46; {11955#false} is VALID [2022-04-28 08:32:32,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {11955#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {11955#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11955#false} is VALID [2022-04-28 08:32:32,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {11955#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {11955#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {11955#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {11955#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {11955#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {11955#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {11955#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {11955#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {11955#false} ~skip~0 := 0; {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {11955#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {11955#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {11955#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {11955#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {11955#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {11955#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {11955#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {11955#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {11955#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {11955#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {11955#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {11955#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {11955#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {11955#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {11955#false} assume 4432 == #t~mem56;havoc #t~mem56; {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {11955#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {11955#false} assume 5 == ~blastFlag~0; {11955#false} is VALID [2022-04-28 08:32:32,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-28 08:32:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:32:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:32,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219111520] [2022-04-28 08:32:32,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219111520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:32,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:32,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:32,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207049196] [2022-04-28 08:32:32,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207049196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:32,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:32,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:32:32,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769349586] [2022-04-28 08:32:32,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:32:32,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:32,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:32,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:32,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:32:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:32:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:32:32,258 INFO L87 Difference]: Start difference. First operand 268 states and 391 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:34,292 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-28 08:32:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:35,230 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2022-04-28 08:32:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:32:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 08:32:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-28 08:32:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-28 08:32:35,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 385 transitions. [2022-04-28 08:32:35,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:35,495 INFO L225 Difference]: With dead ends: 421 [2022-04-28 08:32:35,495 INFO L226 Difference]: Without dead ends: 284 [2022-04-28 08:32:35,496 INFO L412 NwaCegarLoop]: 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-28 08:32:35,496 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:35,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:32:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-28 08:32:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-28 08:32:35,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:35,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,505 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,506 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:35,510 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-28 08:32:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-28 08:32:35,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:35,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:35,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 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 284 states. [2022-04-28 08:32:35,512 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 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 284 states. [2022-04-28 08:32:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:35,517 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-28 08:32:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-28 08:32:35,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:35,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:35,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:35,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2022-04-28 08:32:35,523 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 77 [2022-04-28 08:32:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:35,523 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2022-04-28 08:32:35,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:32:35,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 390 transitions. [2022-04-28 08:32:35,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2022-04-28 08:32:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 08:32:35,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:35,845 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:35,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:32:35,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash -963517886, now seen corresponding path program 1 times [2022-04-28 08:32:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:35,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829891672] [2022-04-28 08:32:51,747 WARN L232 SmtUtils]: Spent 10.47s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:33:01,942 WARN L232 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:33:02,699 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash -963517886, now seen corresponding path program 2 times [2022-04-28 08:33:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593163003] [2022-04-28 08:33:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:02,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13912#true} is VALID [2022-04-28 08:33:02,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-28 08:33:02,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13912#true} {13912#true} #592#return; {13912#true} is VALID [2022-04-28 08:33:02,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {13912#true} call ULTIMATE.init(); {13919#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:02,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {13919#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13912#true} is VALID [2022-04-28 08:33:02,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-28 08:33:02,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13912#true} {13912#true} #592#return; {13912#true} is VALID [2022-04-28 08:33:02,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {13912#true} call #t~ret159 := main(); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {13912#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {13912#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {13912#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {13912#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {13912#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {13912#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {13912#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {13912#true} assume 12292 == #t~mem43;havoc #t~mem43; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {13912#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {13912#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {13912#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {13912#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {13912#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {13912#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {13912#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {13912#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {13912#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {13912#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {13912#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {13912#true} ~skip~0 := 0; {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {13912#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {13912#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {13912#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {13912#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {13912#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {13912#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-28 08:33:02,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {13912#true} assume 4368 == #t~mem48;havoc #t~mem48; {13912#true} is VALID [2022-04-28 08:33:02,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {13912#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {13912#true} is VALID [2022-04-28 08:33:02,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {13912#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13912#true} is VALID [2022-04-28 08:33:02,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {13912#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:02,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13918#(= |ssl3_connect_#t~mem47| 4384)} is VALID [2022-04-28 08:33:02,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {13918#(= |ssl3_connect_#t~mem47| 4384)} assume 4099 == #t~mem47;havoc #t~mem47; {13913#false} is VALID [2022-04-28 08:33:02,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {13913#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {13913#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 50: Hoare triple {13913#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {13913#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {13913#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 53: Hoare triple {13913#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {13913#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {13913#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {13913#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {13913#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#false} ~skip~0 := 0; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {13913#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {13913#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {13913#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {13913#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {13913#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {13913#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {13913#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {13913#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {13913#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {13913#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {13913#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {13913#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {13913#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {13913#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {13913#false} assume 4432 == #t~mem56;havoc #t~mem56; {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {13913#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {13913#false} is VALID [2022-04-28 08:33:02,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {13913#false} assume 5 == ~blastFlag~0; {13913#false} is VALID [2022-04-28 08:33:02,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-28 08:33:02,861 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-28 08:33:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593163003] [2022-04-28 08:33:02,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593163003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:02,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:02,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:02,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829891672] [2022-04-28 08:33:02,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829891672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:02,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:02,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064503139] [2022-04-28 08:33:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:33:02,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:02,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:02,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:02,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:02,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:02,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:02,918 INFO L87 Difference]: Start difference. First operand 268 states and 390 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:04,939 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-28 08:33:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:05,767 INFO L93 Difference]: Finished difference Result 412 states and 603 transitions. [2022-04-28 08:33:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:33:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-28 08:33:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-28 08:33:05,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 373 transitions. [2022-04-28 08:33:06,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:06,036 INFO L225 Difference]: With dead ends: 412 [2022-04-28 08:33:06,036 INFO L226 Difference]: Without dead ends: 275 [2022-04-28 08:33:06,037 INFO L412 NwaCegarLoop]: 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-28 08:33:06,037 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:06,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-28 08:33:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-04-28 08:33:06,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:06,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:06,046 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:06,046 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:06,051 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-28 08:33:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-28 08:33:06,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:06,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:06,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 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 275 states. [2022-04-28 08:33:06,053 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 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 275 states. [2022-04-28 08:33:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:06,057 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-28 08:33:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-28 08:33:06,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:06,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:06,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:06,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 389 transitions. [2022-04-28 08:33:06,062 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 389 transitions. Word has length 78 [2022-04-28 08:33:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:06,063 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 389 transitions. [2022-04-28 08:33:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:06,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 389 transitions. [2022-04-28 08:33:06,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 389 transitions. [2022-04-28 08:33:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 08:33:06,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:06,376 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:06,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:33:06,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -867420063, now seen corresponding path program 1 times [2022-04-28 08:33:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:06,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10159014] [2022-04-28 08:33:06,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -867420063, now seen corresponding path program 2 times [2022-04-28 08:33:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:06,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050383942] [2022-04-28 08:33:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:06,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15834#true} is VALID [2022-04-28 08:33:06,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-28 08:33:06,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15834#true} {15834#true} #592#return; {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {15834#true} call ULTIMATE.init(); {15840#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:06,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15834#true} {15834#true} #592#return; {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {15834#true} call #t~ret159 := main(); {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {15834#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {15834#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {15834#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {15834#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {15834#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {15834#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {15834#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {15834#true} assume 12292 == #t~mem43;havoc #t~mem43; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {15834#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {15834#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {15834#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {15834#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {15834#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {15834#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {15834#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {15834#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {15834#true} is VALID [2022-04-28 08:33:06,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {15834#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {15834#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {15834#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {15834#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {15834#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {15834#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {15834#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {15834#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {15834#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {15834#true} assume 4368 == #t~mem48;havoc #t~mem48; {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {15834#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {15834#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15834#true} is VALID [2022-04-28 08:33:06,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {15834#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {15834#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {15834#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {15834#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {15834#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {15834#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {15834#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {15834#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {15834#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {15834#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {15834#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {15834#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-28 08:33:06,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {15834#true} assume 4384 == #t~mem50;havoc #t~mem50; {15834#true} is VALID [2022-04-28 08:33:06,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {15834#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {15834#true} is VALID [2022-04-28 08:33:06,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {15834#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,523 INFO L290 TraceCheckUtils]: 74: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:06,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15835#false} is VALID [2022-04-28 08:33:06,523 INFO L290 TraceCheckUtils]: 77: Hoare triple {15835#false} assume !false; {15835#false} is VALID [2022-04-28 08:33:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 08:33:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050383942] [2022-04-28 08:33:06,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050383942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:06,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:06,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:06,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10159014] [2022-04-28 08:33:06,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10159014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:06,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:06,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969280684] [2022-04-28 08:33:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:33:06,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:06,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:06,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:06,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:33:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:33:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:33:06,581 INFO L87 Difference]: Start difference. First operand 268 states and 389 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:08,599 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-28 08:33:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:09,496 INFO L93 Difference]: Finished difference Result 539 states and 791 transitions. [2022-04-28 08:33:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:33:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:33:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 08:33:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 08:33:09,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-28 08:33:09,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:09,834 INFO L225 Difference]: With dead ends: 539 [2022-04-28 08:33:09,835 INFO L226 Difference]: Without dead ends: 402 [2022-04-28 08:33:09,835 INFO L412 NwaCegarLoop]: 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-28 08:33:09,835 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:09,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-28 08:33:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2022-04-28 08:33:09,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:09,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,847 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,847 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:09,854 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-28 08:33:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-28 08:33:09,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:09,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:09,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 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 402 states. [2022-04-28 08:33:09,856 INFO L87 Difference]: Start difference. First operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 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 402 states. [2022-04-28 08:33:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:09,863 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-28 08:33:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-28 08:33:09,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:09,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:09,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:09,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 583 transitions. [2022-04-28 08:33:09,873 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 583 transitions. Word has length 78 [2022-04-28 08:33:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:09,873 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 583 transitions. [2022-04-28 08:33:09,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:09,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 402 states and 583 transitions. [2022-04-28 08:33:10,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-28 08:33:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 08:33:10,285 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:10,286 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:10,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:33:10,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash -805380449, now seen corresponding path program 1 times [2022-04-28 08:33:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:10,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550397035] [2022-04-28 08:33:10,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash -805380449, now seen corresponding path program 2 times [2022-04-28 08:33:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:10,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147418911] [2022-04-28 08:33:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:10,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {18535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18529#true} is VALID [2022-04-28 08:33:10,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-28 08:33:10,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18529#true} {18529#true} #592#return; {18529#true} is VALID [2022-04-28 08:33:10,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {18529#true} call ULTIMATE.init(); {18535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:10,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {18535#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18529#true} is VALID [2022-04-28 08:33:10,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-28 08:33:10,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18529#true} {18529#true} #592#return; {18529#true} is VALID [2022-04-28 08:33:10,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {18529#true} call #t~ret159 := main(); {18529#true} is VALID [2022-04-28 08:33:10,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {18529#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {18529#true} is VALID [2022-04-28 08:33:10,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {18529#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {18529#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {18529#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {18529#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {18529#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {18529#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {18529#true} assume 12292 == #t~mem43;havoc #t~mem43; {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {18529#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {18529#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {18529#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {18529#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {18529#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {18529#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {18529#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {18529#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {18529#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {18529#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {18529#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {18529#true} ~skip~0 := 0; {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {18529#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {18529#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {18529#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {18529#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {18529#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {18529#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-28 08:33:10,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {18529#true} assume 4368 == #t~mem48;havoc #t~mem48; {18529#true} is VALID [2022-04-28 08:33:10,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {18529#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {18529#true} is VALID [2022-04-28 08:33:10,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {18529#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 08:33:10,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18530#false} is VALID [2022-04-28 08:33:10,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {18530#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {18530#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {18530#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {18530#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {18530#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {18530#false} ~skip~0 := 0; {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {18530#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {18530#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {18530#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {18530#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {18530#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {18530#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 66: Hoare triple {18530#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {18530#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {18530#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {18530#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {18530#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 71: Hoare triple {18530#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 72: Hoare triple {18530#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 73: Hoare triple {18530#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 74: Hoare triple {18530#false} assume 4432 == #t~mem56;havoc #t~mem56; {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 75: Hoare triple {18530#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {18530#false} assume 5 == ~blastFlag~0; {18530#false} is VALID [2022-04-28 08:33:10,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-28 08:33:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:33:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147418911] [2022-04-28 08:33:10,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147418911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:10,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:10,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:10,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:10,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550397035] [2022-04-28 08:33:10,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550397035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:10,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:10,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471568030] [2022-04-28 08:33:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:33:10,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:10,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:10,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:10,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:33:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:10,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:33:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:33:10,495 INFO L87 Difference]: Start difference. First operand 402 states and 583 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:12,512 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-28 08:33:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:13,102 INFO L93 Difference]: Finished difference Result 697 states and 1013 transitions. [2022-04-28 08:33:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:33:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 08:33:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-28 08:33:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-28 08:33:13,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-28 08:33:13,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:13,358 INFO L225 Difference]: With dead ends: 697 [2022-04-28 08:33:13,358 INFO L226 Difference]: Without dead ends: 426 [2022-04-28 08:33:13,358 INFO L412 NwaCegarLoop]: 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-28 08:33:13,359 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:13,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 08:33:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-04-28 08:33:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-04-28 08:33:13,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:13,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,376 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,376 INFO L87 Difference]: Start difference. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:13,384 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-28 08:33:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-28 08:33:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:13,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:13,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 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 426 states. [2022-04-28 08:33:13,386 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 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 426 states. [2022-04-28 08:33:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:13,393 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-28 08:33:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-28 08:33:13,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:13,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:13,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:13,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 615 transitions. [2022-04-28 08:33:13,404 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 615 transitions. Word has length 78 [2022-04-28 08:33:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:13,404 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 615 transitions. [2022-04-28 08:33:13,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:13,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 615 transitions. [2022-04-28 08:33:13,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-28 08:33:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 08:33:13,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:13,829 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:13,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:33:13,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:13,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1023132448, now seen corresponding path program 1 times [2022-04-28 08:33:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243151134] [2022-04-28 08:33:13,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1023132448, now seen corresponding path program 2 times [2022-04-28 08:33:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:13,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229482088] [2022-04-28 08:33:13,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:13,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {21642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21636#true} is VALID [2022-04-28 08:33:13,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-28 08:33:13,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #592#return; {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:13,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {21642#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #592#return; {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret159 := main(); {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {21636#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {21636#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {21636#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {21636#true} is VALID [2022-04-28 08:33:13,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {21636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {21636#true} assume 12292 == #t~mem43;havoc #t~mem43; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {21636#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {21636#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {21636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {21636#true} assume 4368 == #t~mem48;havoc #t~mem48; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {21636#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {21636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {21636#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {21636#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {21636#true} is VALID [2022-04-28 08:33:13,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {21636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {21636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {21636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {21636#true} assume 4384 == #t~mem50;havoc #t~mem50; {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {21636#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {21636#true} is VALID [2022-04-28 08:33:13,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {21636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {21636#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {21636#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {21636#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {21636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 59: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 60: Hoare triple {21636#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 62: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {21636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {21636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {21636#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {21636#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {21636#true} assume 4400 == #t~mem52;havoc #t~mem52; {21636#true} is VALID [2022-04-28 08:33:13,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {21636#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {21636#true} is VALID [2022-04-28 08:33:13,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {21636#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {21636#true} is VALID [2022-04-28 08:33:14,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {21636#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,003 INFO L290 TraceCheckUtils]: 79: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,003 INFO L290 TraceCheckUtils]: 82: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,004 INFO L290 TraceCheckUtils]: 83: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,005 INFO L290 TraceCheckUtils]: 88: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,005 INFO L290 TraceCheckUtils]: 89: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,005 INFO L290 TraceCheckUtils]: 90: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,005 INFO L290 TraceCheckUtils]: 91: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,006 INFO L290 TraceCheckUtils]: 92: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,006 INFO L290 TraceCheckUtils]: 93: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,006 INFO L290 TraceCheckUtils]: 94: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,006 INFO L290 TraceCheckUtils]: 95: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 08:33:14,007 INFO L290 TraceCheckUtils]: 96: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21637#false} is VALID [2022-04-28 08:33:14,007 INFO L290 TraceCheckUtils]: 97: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-28 08:33:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 08:33:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:14,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229482088] [2022-04-28 08:33:14,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229482088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:14,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:14,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:14,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:14,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243151134] [2022-04-28 08:33:14,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243151134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:14,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:14,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954319747] [2022-04-28 08:33:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 08:33:14,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:14,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:14,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:14,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:33:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:33:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:33:14,058 INFO L87 Difference]: Start difference. First operand 426 states and 615 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:16,076 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-28 08:33:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:16,959 INFO L93 Difference]: Finished difference Result 854 states and 1242 transitions. [2022-04-28 08:33:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:33:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 08:33:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-28 08:33:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-28 08:33:16,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-28 08:33:17,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:17,280 INFO L225 Difference]: With dead ends: 854 [2022-04-28 08:33:17,280 INFO L226 Difference]: Without dead ends: 559 [2022-04-28 08:33:17,280 INFO L412 NwaCegarLoop]: 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-28 08:33:17,282 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:17,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-28 08:33:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-04-28 08:33:17,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:17,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:17,296 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:17,297 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:17,307 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-28 08:33:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-28 08:33:17,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:17,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:17,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 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 559 states. [2022-04-28 08:33:17,310 INFO L87 Difference]: Start difference. First operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 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 559 states. [2022-04-28 08:33:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:17,321 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-28 08:33:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-28 08:33:17,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:17,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:17,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:17,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 808 transitions. [2022-04-28 08:33:17,358 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 808 transitions. Word has length 98 [2022-04-28 08:33:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:17,358 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 808 transitions. [2022-04-28 08:33:17,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:17,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 559 states and 808 transitions. [2022-04-28 08:33:17,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 808 edges. 808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-28 08:33:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 08:33:17,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:17,909 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 08:33:17,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:33:17,909 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 1 times [2022-04-28 08:33:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:17,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200186334] [2022-04-28 08:33:17,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 2 times [2022-04-28 08:33:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:17,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196546202] [2022-04-28 08:33:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:18,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:18,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {25595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {25589#true} is VALID [2022-04-28 08:33:18,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-28 08:33:18,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25589#true} {25589#true} #592#return; {25589#true} is VALID [2022-04-28 08:33:18,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {25589#true} call ULTIMATE.init(); {25595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:18,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25589#true} {25589#true} #592#return; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {25589#true} call #t~ret159 := main(); {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {25589#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {25589#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#true} assume 12292 == #t~mem43;havoc #t~mem43; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {25589#true} is VALID [2022-04-28 08:33:18,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {25589#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {25589#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {25589#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {25589#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {25589#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {25589#true} assume 4368 == #t~mem48;havoc #t~mem48; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {25589#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {25589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {25589#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {25589#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {25589#true} assume 4384 == #t~mem50;havoc #t~mem50; {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {25589#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {25589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {25589#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {25589#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {25589#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {25589#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {25589#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {25589#true} assume 4400 == #t~mem52;havoc #t~mem52; {25589#true} is VALID [2022-04-28 08:33:18,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {25589#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 72: Hoare triple {25589#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 73: Hoare triple {25589#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {25589#true} assume !(~ret~0 <= 0); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 75: Hoare triple {25589#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {25589#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 79: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {25589#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 86: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 87: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {25589#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 89: Hoare triple {25589#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 90: Hoare triple {25589#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 91: Hoare triple {25589#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 92: Hoare triple {25589#true} assume 4416 == #t~mem54;havoc #t~mem54; {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 93: Hoare triple {25589#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {25589#true} is VALID [2022-04-28 08:33:18,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {25589#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,060 INFO L290 TraceCheckUtils]: 99: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,060 INFO L290 TraceCheckUtils]: 100: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,060 INFO L290 TraceCheckUtils]: 101: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,060 INFO L290 TraceCheckUtils]: 102: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,061 INFO L290 TraceCheckUtils]: 103: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,061 INFO L290 TraceCheckUtils]: 104: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,061 INFO L290 TraceCheckUtils]: 105: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,061 INFO L290 TraceCheckUtils]: 106: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,062 INFO L290 TraceCheckUtils]: 107: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,062 INFO L290 TraceCheckUtils]: 108: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,062 INFO L290 TraceCheckUtils]: 109: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,062 INFO L290 TraceCheckUtils]: 110: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,062 INFO L290 TraceCheckUtils]: 111: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,063 INFO L290 TraceCheckUtils]: 112: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,063 INFO L290 TraceCheckUtils]: 113: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,063 INFO L290 TraceCheckUtils]: 114: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,063 INFO L290 TraceCheckUtils]: 115: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,064 INFO L290 TraceCheckUtils]: 116: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 08:33:18,064 INFO L290 TraceCheckUtils]: 117: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25590#false} is VALID [2022-04-28 08:33:18,064 INFO L290 TraceCheckUtils]: 118: Hoare triple {25590#false} assume !false; {25590#false} is VALID [2022-04-28 08:33:18,064 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-28 08:33:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:18,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196546202] [2022-04-28 08:33:18,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196546202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:18,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:18,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:18,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:18,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200186334] [2022-04-28 08:33:18,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200186334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:18,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:18,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:33:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9867590] [2022-04-28 08:33:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 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 119 [2022-04-28 08:33:18,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:18,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:18,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:18,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:33:18,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:18,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:33:18,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:33:18,127 INFO L87 Difference]: Start difference. First operand 559 states and 808 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:20,143 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-28 08:33:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:21,046 INFO L93 Difference]: Finished difference Result 1119 states and 1626 transitions. [2022-04-28 08:33:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:33:21,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 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 119 [2022-04-28 08:33:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 08:33:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 08:33:21,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-28 08:33:21,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:21,359 INFO L225 Difference]: With dead ends: 1119 [2022-04-28 08:33:21,359 INFO L226 Difference]: Without dead ends: 691 [2022-04-28 08:33:21,360 INFO L412 NwaCegarLoop]: 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-28 08:33:21,361 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:21,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 480 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-28 08:33:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-04-28 08:33:21,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:21,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,378 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,378 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:21,393 INFO L93 Difference]: Finished difference Result 691 states and 999 transitions. [2022-04-28 08:33:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-28 08:33:21,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:21,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:21,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 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 691 states. [2022-04-28 08:33:21,396 INFO L87 Difference]: Start difference. First operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 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 691 states. [2022-04-28 08:33:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:21,412 INFO L93 Difference]: Finished difference Result 691 states and 999 transitions. [2022-04-28 08:33:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-28 08:33:21,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:21,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:21,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:21,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 999 transitions. [2022-04-28 08:33:21,442 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 999 transitions. Word has length 119 [2022-04-28 08:33:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:21,442 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 999 transitions. [2022-04-28 08:33:21,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:21,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 999 transitions. [2022-04-28 08:33:22,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 999 edges. 999 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-28 08:33:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 08:33:22,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:22,132 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:22,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:33:22,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 409023911, now seen corresponding path program 1 times [2022-04-28 08:33:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:22,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1185476575] [2022-04-28 08:33:22,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 409023911, now seen corresponding path program 2 times [2022-04-28 08:33:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:22,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185534752] [2022-04-28 08:33:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:22,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {30607#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {30600#true} is VALID [2022-04-28 08:33:22,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {30600#true} assume true; {30600#true} is VALID [2022-04-28 08:33:22,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30600#true} {30600#true} #592#return; {30600#true} is VALID [2022-04-28 08:33:22,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {30600#true} call ULTIMATE.init(); {30607#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:22,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {30607#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {30600#true} is VALID [2022-04-28 08:33:22,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {30600#true} assume true; {30600#true} is VALID [2022-04-28 08:33:22,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30600#true} {30600#true} #592#return; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {30600#true} call #t~ret159 := main(); {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {30600#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {30600#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {30600#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {30600#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {30600#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {30600#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {30600#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {30600#true} assume 12292 == #t~mem43;havoc #t~mem43; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {30600#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {30600#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {30600#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {30600#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {30600#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {30600#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {30600#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {30600#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {30600#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {30600#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {30600#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {30600#true} ~skip~0 := 0; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {30600#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {30600#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {30600#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {30600#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {30600#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {30600#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {30600#true} assume 4368 == #t~mem48;havoc #t~mem48; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {30600#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {30600#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {30600#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {30600#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {30600#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {30600#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {30600#true} ~skip~0 := 0; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {30600#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {30600#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {30600#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {30600#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {30600#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {30600#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {30600#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {30600#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {30600#true} assume 4384 == #t~mem50;havoc #t~mem50; {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {30600#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {30600#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30600#true} is VALID [2022-04-28 08:33:22,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {30600#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {30600#true} is VALID [2022-04-28 08:33:22,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {30600#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:22,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30606#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-28 08:33:22,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {30606#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {30601#false} is VALID [2022-04-28 08:33:22,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {30601#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {30601#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {30601#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {30601#false} assume !(~ret~0 <= 0); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {30601#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {30601#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {30601#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {30601#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {30601#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {30601#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {30601#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {30601#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {30601#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {30601#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {30601#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {30601#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {30601#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {30601#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {30601#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 92: Hoare triple {30601#false} assume 4416 == #t~mem54;havoc #t~mem54; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 93: Hoare triple {30601#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 94: Hoare triple {30601#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 95: Hoare triple {30601#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {30601#false} assume !(0 == ~tmp___6~0); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {30601#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {30601#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 99: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 100: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-28 08:33:22,298 INFO L290 TraceCheckUtils]: 101: Hoare triple {30601#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {30601#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 103: Hoare triple {30601#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 104: Hoare triple {30601#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 105: Hoare triple {30601#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {30601#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 107: Hoare triple {30601#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 108: Hoare triple {30601#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 109: Hoare triple {30601#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 110: Hoare triple {30601#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 111: Hoare triple {30601#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 112: Hoare triple {30601#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 113: Hoare triple {30601#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,299 INFO L290 TraceCheckUtils]: 114: Hoare triple {30601#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 115: Hoare triple {30601#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 116: Hoare triple {30601#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 117: Hoare triple {30601#false} assume 4448 == #t~mem58;havoc #t~mem58; {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 118: Hoare triple {30601#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 119: Hoare triple {30601#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 120: Hoare triple {30601#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 121: Hoare triple {30601#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 122: Hoare triple {30601#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 123: Hoare triple {30601#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 124: Hoare triple {30601#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 125: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 126: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-28 08:33:22,300 INFO L290 TraceCheckUtils]: 127: Hoare triple {30601#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 128: Hoare triple {30601#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 129: Hoare triple {30601#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 130: Hoare triple {30601#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 131: Hoare triple {30601#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 132: Hoare triple {30601#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 133: Hoare triple {30601#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 134: Hoare triple {30601#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 135: Hoare triple {30601#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 136: Hoare triple {30601#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 137: Hoare triple {30601#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 138: Hoare triple {30601#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 139: Hoare triple {30601#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 140: Hoare triple {30601#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-28 08:33:22,301 INFO L290 TraceCheckUtils]: 141: Hoare triple {30601#false} assume 4432 == #t~mem56;havoc #t~mem56; {30601#false} is VALID [2022-04-28 08:33:22,302 INFO L290 TraceCheckUtils]: 142: Hoare triple {30601#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {30601#false} is VALID [2022-04-28 08:33:22,302 INFO L290 TraceCheckUtils]: 143: Hoare triple {30601#false} assume 5 == ~blastFlag~0; {30601#false} is VALID [2022-04-28 08:33:22,302 INFO L290 TraceCheckUtils]: 144: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-28 08:33:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 08:33:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:22,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185534752] [2022-04-28 08:33:22,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185534752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:22,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:22,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:22,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:22,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1185476575] [2022-04-28 08:33:22,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1185476575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:22,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:22,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296657160] [2022-04-28 08:33:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-28 08:33:22,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:22,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:22,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:22,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:22,375 INFO L87 Difference]: Start difference. First operand 691 states and 999 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:24,407 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-28 08:33:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:25,437 INFO L93 Difference]: Finished difference Result 1825 states and 2651 transitions. [2022-04-28 08:33:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-28 08:33:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:33:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:33:25,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 08:33:25,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:25,786 INFO L225 Difference]: With dead ends: 1825 [2022-04-28 08:33:25,786 INFO L226 Difference]: Without dead ends: 1150 [2022-04-28 08:33:25,787 INFO L412 NwaCegarLoop]: 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-28 08:33:25,787 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:25,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 286 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:33:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-04-28 08:33:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 796. [2022-04-28 08:33:25,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:25,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1150 states. Second operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,820 INFO L74 IsIncluded]: Start isIncluded. First operand 1150 states. Second operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,821 INFO L87 Difference]: Start difference. First operand 1150 states. Second operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:25,859 INFO L93 Difference]: Finished difference Result 1150 states and 1667 transitions. [2022-04-28 08:33:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1667 transitions. [2022-04-28 08:33:25,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:25,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:25,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 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 1150 states. [2022-04-28 08:33:25,862 INFO L87 Difference]: Start difference. First operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 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 1150 states. [2022-04-28 08:33:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:25,901 INFO L93 Difference]: Finished difference Result 1150 states and 1667 transitions. [2022-04-28 08:33:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1667 transitions. [2022-04-28 08:33:25,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:25,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:25,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:25,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1164 transitions. [2022-04-28 08:33:25,942 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1164 transitions. Word has length 145 [2022-04-28 08:33:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:25,942 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1164 transitions. [2022-04-28 08:33:25,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:25,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 796 states and 1164 transitions. [2022-04-28 08:33:26,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1164 edges. 1164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1164 transitions. [2022-04-28 08:33:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 08:33:26,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:26,785 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:26,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:33:26,785 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1531558103, now seen corresponding path program 1 times [2022-04-28 08:33:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:26,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330289717] [2022-04-28 08:33:26,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1531558103, now seen corresponding path program 2 times [2022-04-28 08:33:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:26,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610765900] [2022-04-28 08:33:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:26,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {38161#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {38154#true} is VALID [2022-04-28 08:33:26,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {38154#true} assume true; {38154#true} is VALID [2022-04-28 08:33:26,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38154#true} {38154#true} #592#return; {38154#true} is VALID [2022-04-28 08:33:26,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {38154#true} call ULTIMATE.init(); {38161#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:26,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {38161#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {38154#true} is VALID [2022-04-28 08:33:26,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {38154#true} assume true; {38154#true} is VALID [2022-04-28 08:33:26,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38154#true} {38154#true} #592#return; {38154#true} is VALID [2022-04-28 08:33:26,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {38154#true} call #t~ret159 := main(); {38154#true} is VALID [2022-04-28 08:33:26,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {38154#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {38154#true} is VALID [2022-04-28 08:33:26,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {38154#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {38154#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {38154#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {38154#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {38154#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {38154#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {38154#true} assume 12292 == #t~mem43;havoc #t~mem43; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {38154#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {38154#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {38154#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {38154#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {38154#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {38154#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {38154#true} is VALID [2022-04-28 08:33:26,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {38154#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {38154#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {38154#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {38154#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {38154#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {38154#true} assume 4368 == #t~mem48;havoc #t~mem48; {38154#true} is VALID [2022-04-28 08:33:26,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {38154#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {38154#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {38154#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {38154#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {38154#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {38154#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {38154#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {38154#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {38154#true} assume 4384 == #t~mem50;havoc #t~mem50; {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {38154#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {38154#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {38154#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {38154#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {38154#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {38154#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {38154#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {38154#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {38154#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {38154#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {38154#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {38154#true} assume 4400 == #t~mem52;havoc #t~mem52; {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {38154#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {38154#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {38154#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {38154#true} assume !(~ret~0 <= 0); {38154#true} is VALID [2022-04-28 08:33:26,979 INFO L290 TraceCheckUtils]: 75: Hoare triple {38154#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {38154#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {38154#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 81: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 82: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 83: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 84: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 85: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 86: Hoare triple {38154#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 87: Hoare triple {38154#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 88: Hoare triple {38154#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,980 INFO L290 TraceCheckUtils]: 89: Hoare triple {38154#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,981 INFO L290 TraceCheckUtils]: 90: Hoare triple {38154#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,981 INFO L290 TraceCheckUtils]: 91: Hoare triple {38154#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-28 08:33:26,981 INFO L290 TraceCheckUtils]: 92: Hoare triple {38154#true} assume 4416 == #t~mem54;havoc #t~mem54; {38154#true} is VALID [2022-04-28 08:33:26,981 INFO L290 TraceCheckUtils]: 93: Hoare triple {38154#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {38154#true} is VALID [2022-04-28 08:33:26,981 INFO L290 TraceCheckUtils]: 94: Hoare triple {38154#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {38154#true} is VALID [2022-04-28 08:33:26,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {38154#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,982 INFO L290 TraceCheckUtils]: 96: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,982 INFO L290 TraceCheckUtils]: 98: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,983 INFO L290 TraceCheckUtils]: 99: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,983 INFO L290 TraceCheckUtils]: 100: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,983 INFO L290 TraceCheckUtils]: 101: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,983 INFO L290 TraceCheckUtils]: 102: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,984 INFO L290 TraceCheckUtils]: 103: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,984 INFO L290 TraceCheckUtils]: 104: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,984 INFO L290 TraceCheckUtils]: 105: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,984 INFO L290 TraceCheckUtils]: 106: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,985 INFO L290 TraceCheckUtils]: 107: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,985 INFO L290 TraceCheckUtils]: 108: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,985 INFO L290 TraceCheckUtils]: 109: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,985 INFO L290 TraceCheckUtils]: 110: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,986 INFO L290 TraceCheckUtils]: 111: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,986 INFO L290 TraceCheckUtils]: 112: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,986 INFO L290 TraceCheckUtils]: 113: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:33:26,986 INFO L290 TraceCheckUtils]: 114: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38160#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 115: Hoare triple {38160#(= |ssl3_connect_#t~mem56| 4432)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 116: Hoare triple {38155#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 117: Hoare triple {38155#false} assume 4448 == #t~mem58;havoc #t~mem58; {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 118: Hoare triple {38155#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 119: Hoare triple {38155#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 120: Hoare triple {38155#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 121: Hoare triple {38155#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 122: Hoare triple {38155#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 123: Hoare triple {38155#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 124: Hoare triple {38155#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38155#false} is VALID [2022-04-28 08:33:26,987 INFO L290 TraceCheckUtils]: 125: Hoare triple {38155#false} ~skip~0 := 0; {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 126: Hoare triple {38155#false} assume !false; {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 127: Hoare triple {38155#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 128: Hoare triple {38155#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 129: Hoare triple {38155#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 130: Hoare triple {38155#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 131: Hoare triple {38155#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 132: Hoare triple {38155#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 133: Hoare triple {38155#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 134: Hoare triple {38155#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 135: Hoare triple {38155#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 136: Hoare triple {38155#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 137: Hoare triple {38155#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 138: Hoare triple {38155#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,988 INFO L290 TraceCheckUtils]: 139: Hoare triple {38155#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,989 INFO L290 TraceCheckUtils]: 140: Hoare triple {38155#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-28 08:33:26,989 INFO L290 TraceCheckUtils]: 141: Hoare triple {38155#false} assume 4432 == #t~mem56;havoc #t~mem56; {38155#false} is VALID [2022-04-28 08:33:26,989 INFO L290 TraceCheckUtils]: 142: Hoare triple {38155#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {38155#false} is VALID [2022-04-28 08:33:26,989 INFO L290 TraceCheckUtils]: 143: Hoare triple {38155#false} assume 5 == ~blastFlag~0; {38155#false} is VALID [2022-04-28 08:33:26,989 INFO L290 TraceCheckUtils]: 144: Hoare triple {38155#false} assume !false; {38155#false} is VALID [2022-04-28 08:33:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 08:33:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:26,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610765900] [2022-04-28 08:33:26,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610765900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:26,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:26,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:26,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330289717] [2022-04-28 08:33:26,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330289717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:26,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:26,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:26,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592960382] [2022-04-28 08:33:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:26,990 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 145 [2022-04-28 08:33:26,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:26,991 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-28 08:33:27,063 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-28 08:33:27,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:27,064 INFO L87 Difference]: Start difference. First operand 796 states and 1164 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-28 08:33:29,091 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-28 08:33:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:30,204 INFO L93 Difference]: Finished difference Result 1783 states and 2599 transitions. [2022-04-28 08:33:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:33:30,205 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 145 [2022-04-28 08:33:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:30,214 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-28 08:33:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-28 08:33:30,216 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-28 08:33:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-28 08:33:30,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 414 transitions. [2022-04-28 08:33:30,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:30,500 INFO L225 Difference]: With dead ends: 1783 [2022-04-28 08:33:30,500 INFO L226 Difference]: Without dead ends: 1003 [2022-04-28 08:33:30,501 INFO L412 NwaCegarLoop]: 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-28 08:33:30,502 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 46 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:30,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 525 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:33:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-28 08:33:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 892. [2022-04-28 08:33:30,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:30,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:30,530 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:30,531 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:30,561 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2022-04-28 08:33:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1451 transitions. [2022-04-28 08:33:30,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:30,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:30,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 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 1003 states. [2022-04-28 08:33:30,564 INFO L87 Difference]: Start difference. First operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 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 1003 states. [2022-04-28 08:33:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:30,594 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2022-04-28 08:33:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1451 transitions. [2022-04-28 08:33:30,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:30,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:30,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:30,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:33:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1320 transitions. [2022-04-28 08:33:30,638 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1320 transitions. Word has length 145 [2022-04-28 08:33:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:30,638 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1320 transitions. [2022-04-28 08:33:30,638 INFO L496 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-28 08:33:30,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 892 states and 1320 transitions. [2022-04-28 08:33:31,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1320 edges. 1320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:33:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1320 transitions. [2022-04-28 08:33:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-28 08:33:31,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:31,602 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:33:31,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:33:31,603 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1970264700, now seen corresponding path program 1 times [2022-04-28 08:33:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:31,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430393573] [2022-04-28 08:33:36,640 WARN L232 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 193 DAG size of output: 187 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:33:47,692 WARN L232 SmtUtils]: Spent 9.60s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:33:57,920 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:33:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1970264700, now seen corresponding path program 2 times [2022-04-28 08:33:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371602156] [2022-04-28 08:33:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:58,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {45529#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {45522#true} is VALID [2022-04-28 08:33:58,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {45522#true} assume true; {45522#true} is VALID [2022-04-28 08:33:58,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45522#true} {45522#true} #592#return; {45522#true} is VALID [2022-04-28 08:33:58,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {45522#true} call ULTIMATE.init(); {45529#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:33:58,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {45529#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {45522#true} assume true; {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45522#true} {45522#true} #592#return; {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {45522#true} call #t~ret159 := main(); {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {45522#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L272 TraceCheckUtils]: 6: Hoare triple {45522#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {45522#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {45522#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {45522#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {45522#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {45522#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {45522#true} assume 12292 == #t~mem43;havoc #t~mem43; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {45522#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {45522#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {45522#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {45522#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {45522#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {45522#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {45522#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {45522#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {45522#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {45522#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {45522#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {45522#true} assume 4368 == #t~mem48;havoc #t~mem48; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {45522#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {45522#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {45522#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {45522#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {45522#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-28 08:33:58,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {45522#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {45522#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {45522#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {45522#true} assume 4384 == #t~mem50;havoc #t~mem50; {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {45522#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {45522#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {45522#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {45522#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {45522#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {45522#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {45522#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 65: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {45522#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 67: Hoare triple {45522#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 68: Hoare triple {45522#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {45522#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {45522#true} assume 4400 == #t~mem52;havoc #t~mem52; {45522#true} is VALID [2022-04-28 08:33:58,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {45522#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {45522#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {45522#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {45522#true} assume !(~ret~0 <= 0); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {45522#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {45522#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {45522#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 86: Hoare triple {45522#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {45522#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {45522#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {45522#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {45522#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {45522#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {45522#true} assume 4416 == #t~mem54;havoc #t~mem54; {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {45522#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {45522#true} is VALID [2022-04-28 08:33:58,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {45522#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {45522#true} is VALID [2022-04-28 08:33:58,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {45522#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,120 INFO L290 TraceCheckUtils]: 96: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,120 INFO L290 TraceCheckUtils]: 97: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,120 INFO L290 TraceCheckUtils]: 98: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,121 INFO L290 TraceCheckUtils]: 99: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,121 INFO L290 TraceCheckUtils]: 100: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,121 INFO L290 TraceCheckUtils]: 101: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 102: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 103: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45528#(not (= |ssl3_connect_#t~mem45| 4096))} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 104: Hoare triple {45528#(not (= |ssl3_connect_#t~mem45| 4096))} assume 4096 == #t~mem45;havoc #t~mem45; {45523#false} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 105: Hoare triple {45523#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 106: Hoare triple {45523#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45523#false} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 107: Hoare triple {45523#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,122 INFO L290 TraceCheckUtils]: 108: Hoare triple {45523#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 109: Hoare triple {45523#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 110: Hoare triple {45523#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 111: Hoare triple {45523#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 112: Hoare triple {45523#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 113: Hoare triple {45523#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 114: Hoare triple {45523#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 115: Hoare triple {45523#false} ~skip~0 := 0; {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 116: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 117: Hoare triple {45523#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 118: Hoare triple {45523#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 119: Hoare triple {45523#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 120: Hoare triple {45523#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 121: Hoare triple {45523#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,123 INFO L290 TraceCheckUtils]: 122: Hoare triple {45523#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 123: Hoare triple {45523#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 124: Hoare triple {45523#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 125: Hoare triple {45523#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 126: Hoare triple {45523#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 127: Hoare triple {45523#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 128: Hoare triple {45523#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 129: Hoare triple {45523#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 130: Hoare triple {45523#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 131: Hoare triple {45523#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 132: Hoare triple {45523#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 133: Hoare triple {45523#false} assume 4448 == #t~mem58;havoc #t~mem58; {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 134: Hoare triple {45523#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 135: Hoare triple {45523#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {45523#false} is VALID [2022-04-28 08:33:58,124 INFO L290 TraceCheckUtils]: 136: Hoare triple {45523#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 137: Hoare triple {45523#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 138: Hoare triple {45523#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 139: Hoare triple {45523#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 140: Hoare triple {45523#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 141: Hoare triple {45523#false} ~skip~0 := 0; {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 142: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 143: Hoare triple {45523#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 144: Hoare triple {45523#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 145: Hoare triple {45523#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 146: Hoare triple {45523#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 147: Hoare triple {45523#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 148: Hoare triple {45523#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 149: Hoare triple {45523#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 150: Hoare triple {45523#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,125 INFO L290 TraceCheckUtils]: 151: Hoare triple {45523#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 152: Hoare triple {45523#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 153: Hoare triple {45523#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 154: Hoare triple {45523#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 155: Hoare triple {45523#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 156: Hoare triple {45523#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 157: Hoare triple {45523#false} assume 4432 == #t~mem56;havoc #t~mem56; {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 158: Hoare triple {45523#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 159: Hoare triple {45523#false} assume 5 == ~blastFlag~0; {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L290 TraceCheckUtils]: 160: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-28 08:33:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 08:33:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:58,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371602156] [2022-04-28 08:33:58,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371602156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:58,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:58,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:58,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:58,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430393573] [2022-04-28 08:33:58,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430393573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:58,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:58,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:33:58,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944699655] [2022-04-28 08:33:58,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:58,128 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 161 [2022-04-28 08:33:58,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:58,128 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-28 08:33:58,206 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-28 08:33:58,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:33:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:33:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:33:58,207 INFO L87 Difference]: Start difference. First operand 892 states and 1320 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-28 08:34:00,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:01,426 INFO L93 Difference]: Finished difference Result 2162 states and 3203 transitions. [2022-04-28 08:34:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:34:01,427 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 161 [2022-04-28 08:34:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:01,427 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-28 08:34:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 08:34:01,429 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-28 08:34:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 08:34:01,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 08:34:01,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:01,789 INFO L225 Difference]: With dead ends: 2162 [2022-04-28 08:34:01,789 INFO L226 Difference]: Without dead ends: 1286 [2022-04-28 08:34:01,790 INFO L412 NwaCegarLoop]: 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-28 08:34:01,791 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 118 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:01,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 306 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:34:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-28 08:34:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 897. [2022-04-28 08:34:01,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:01,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1286 states. Second operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:01,834 INFO L74 IsIncluded]: Start isIncluded. First operand 1286 states. Second operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:01,834 INFO L87 Difference]: Start difference. First operand 1286 states. Second operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:01,879 INFO L93 Difference]: Finished difference Result 1286 states and 1889 transitions. [2022-04-28 08:34:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1889 transitions. [2022-04-28 08:34:01,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:01,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:01,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 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 1286 states. [2022-04-28 08:34:01,882 INFO L87 Difference]: Start difference. First operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 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 1286 states. [2022-04-28 08:34:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:01,927 INFO L93 Difference]: Finished difference Result 1286 states and 1889 transitions. [2022-04-28 08:34:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1889 transitions. [2022-04-28 08:34:01,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:01,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:01,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:01,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1316 transitions. [2022-04-28 08:34:01,964 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1316 transitions. Word has length 161 [2022-04-28 08:34:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:01,964 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1316 transitions. [2022-04-28 08:34:01,964 INFO L496 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-28 08:34:01,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 897 states and 1316 transitions. [2022-04-28 08:34:02,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1316 edges. 1316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1316 transitions. [2022-04-28 08:34:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 08:34:02,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:02,981 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:34:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:34:02,981 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1316927770, now seen corresponding path program 1 times [2022-04-28 08:34:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938969462] [2022-04-28 08:34:08,286 WARN L232 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 198 DAG size of output: 190 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:34:20,445 WARN L232 SmtUtils]: Spent 10.75s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:34:28,965 WARN L232 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:34:31,349 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:34:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1316927770, now seen corresponding path program 2 times [2022-04-28 08:34:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:34:31,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434651683] [2022-04-28 08:34:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:34:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:34:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:34:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:34:31,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {54231#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {54224#true} is VALID [2022-04-28 08:34:31,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {54224#true} assume true; {54224#true} is VALID [2022-04-28 08:34:31,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54224#true} {54224#true} #592#return; {54224#true} is VALID [2022-04-28 08:34:31,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {54224#true} call ULTIMATE.init(); {54231#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:34:31,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {54231#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {54224#true} is VALID [2022-04-28 08:34:31,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {54224#true} assume true; {54224#true} is VALID [2022-04-28 08:34:31,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54224#true} {54224#true} #592#return; {54224#true} is VALID [2022-04-28 08:34:31,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {54224#true} call #t~ret159 := main(); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {54224#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {54224#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {54224#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {54224#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {54224#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {54224#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {54224#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {54224#true} assume 12292 == #t~mem43;havoc #t~mem43; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {54224#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {54224#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {54224#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {54224#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {54224#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {54224#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {54224#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {54224#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {54224#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {54224#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {54224#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {54224#true} assume 4368 == #t~mem48;havoc #t~mem48; {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {54224#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {54224#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {54224#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {54224#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {54224#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-28 08:34:31,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {54224#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {54224#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {54224#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {54224#true} assume 4384 == #t~mem50;havoc #t~mem50; {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {54224#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {54224#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {54224#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {54224#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {54224#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {54224#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {54224#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 66: Hoare triple {54224#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 67: Hoare triple {54224#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {54224#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {54224#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {54224#true} assume 4400 == #t~mem52;havoc #t~mem52; {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {54224#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {54224#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {54224#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 74: Hoare triple {54224#true} assume !(~ret~0 <= 0); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 75: Hoare triple {54224#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 76: Hoare triple {54224#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 77: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {54224#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {54224#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 87: Hoare triple {54224#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {54224#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 89: Hoare triple {54224#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 90: Hoare triple {54224#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 91: Hoare triple {54224#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 92: Hoare triple {54224#true} assume 4416 == #t~mem54;havoc #t~mem54; {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {54224#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {54224#true} is VALID [2022-04-28 08:34:31,528 INFO L290 TraceCheckUtils]: 94: Hoare triple {54224#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {54224#true} is VALID [2022-04-28 08:34:31,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {54224#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,537 INFO L290 TraceCheckUtils]: 96: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,537 INFO L290 TraceCheckUtils]: 97: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,537 INFO L290 TraceCheckUtils]: 98: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,538 INFO L290 TraceCheckUtils]: 99: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,538 INFO L290 TraceCheckUtils]: 100: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,538 INFO L290 TraceCheckUtils]: 101: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,538 INFO L290 TraceCheckUtils]: 102: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,539 INFO L290 TraceCheckUtils]: 103: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:34:31,539 INFO L290 TraceCheckUtils]: 104: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54230#(= |ssl3_connect_#t~mem46| 4432)} is VALID [2022-04-28 08:34:31,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {54230#(= |ssl3_connect_#t~mem46| 4432)} assume 20480 == #t~mem46;havoc #t~mem46; {54225#false} is VALID [2022-04-28 08:34:31,539 INFO L290 TraceCheckUtils]: 106: Hoare triple {54225#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 107: Hoare triple {54225#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 108: Hoare triple {54225#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 109: Hoare triple {54225#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 110: Hoare triple {54225#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 111: Hoare triple {54225#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 112: Hoare triple {54225#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 113: Hoare triple {54225#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 114: Hoare triple {54225#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 115: Hoare triple {54225#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 116: Hoare triple {54225#false} ~skip~0 := 0; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 117: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 118: Hoare triple {54225#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 119: Hoare triple {54225#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,540 INFO L290 TraceCheckUtils]: 120: Hoare triple {54225#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 121: Hoare triple {54225#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 122: Hoare triple {54225#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 123: Hoare triple {54225#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {54225#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 125: Hoare triple {54225#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 126: Hoare triple {54225#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 127: Hoare triple {54225#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 128: Hoare triple {54225#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 129: Hoare triple {54225#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 130: Hoare triple {54225#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 131: Hoare triple {54225#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 132: Hoare triple {54225#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 133: Hoare triple {54225#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,541 INFO L290 TraceCheckUtils]: 134: Hoare triple {54225#false} assume 4448 == #t~mem58;havoc #t~mem58; {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 135: Hoare triple {54225#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 136: Hoare triple {54225#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 137: Hoare triple {54225#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 138: Hoare triple {54225#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 139: Hoare triple {54225#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 140: Hoare triple {54225#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 141: Hoare triple {54225#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 142: Hoare triple {54225#false} ~skip~0 := 0; {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 143: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 144: Hoare triple {54225#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 145: Hoare triple {54225#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 146: Hoare triple {54225#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 147: Hoare triple {54225#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,542 INFO L290 TraceCheckUtils]: 148: Hoare triple {54225#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 149: Hoare triple {54225#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 150: Hoare triple {54225#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 151: Hoare triple {54225#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 152: Hoare triple {54225#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 153: Hoare triple {54225#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 154: Hoare triple {54225#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 155: Hoare triple {54225#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 156: Hoare triple {54225#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 157: Hoare triple {54225#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 158: Hoare triple {54225#false} assume 4432 == #t~mem56;havoc #t~mem56; {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 159: Hoare triple {54225#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 160: Hoare triple {54225#false} assume 5 == ~blastFlag~0; {54225#false} is VALID [2022-04-28 08:34:31,543 INFO L290 TraceCheckUtils]: 161: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-28 08:34:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 08:34:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:34:31,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434651683] [2022-04-28 08:34:31,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434651683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:31,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:31,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:31,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:34:31,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938969462] [2022-04-28 08:34:31,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938969462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:34:31,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:34:31,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:34:31,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174271409] [2022-04-28 08:34:31,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:34:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 08:34:31,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:34:31,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:31,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:31,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:34:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:34:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:34:31,616 INFO L87 Difference]: Start difference. First operand 897 states and 1316 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:33,644 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-28 08:34:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:34,764 INFO L93 Difference]: Finished difference Result 1889 states and 2743 transitions. [2022-04-28 08:34:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:34:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 08:34:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:34:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-04-28 08:34:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-04-28 08:34:34,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 412 transitions. [2022-04-28 08:34:35,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:35,051 INFO L225 Difference]: With dead ends: 1889 [2022-04-28 08:34:35,051 INFO L226 Difference]: Without dead ends: 1008 [2022-04-28 08:34:35,055 INFO L412 NwaCegarLoop]: 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-28 08:34:35,056 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 54 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:34:35,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 523 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:34:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-04-28 08:34:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 897. [2022-04-28 08:34:35,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:34:35,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1008 states. Second operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:35,089 INFO L74 IsIncluded]: Start isIncluded. First operand 1008 states. Second operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:35,090 INFO L87 Difference]: Start difference. First operand 1008 states. Second operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:35,120 INFO L93 Difference]: Finished difference Result 1008 states and 1443 transitions. [2022-04-28 08:34:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1443 transitions. [2022-04-28 08:34:35,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:35,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:35,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 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 1008 states. [2022-04-28 08:34:35,123 INFO L87 Difference]: Start difference. First operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 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 1008 states. [2022-04-28 08:34:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:34:35,153 INFO L93 Difference]: Finished difference Result 1008 states and 1443 transitions. [2022-04-28 08:34:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1443 transitions. [2022-04-28 08:34:35,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:34:35,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:34:35,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:34:35,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:34:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1312 transitions. [2022-04-28 08:34:35,201 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1312 transitions. Word has length 162 [2022-04-28 08:34:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:34:35,201 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1312 transitions. [2022-04-28 08:34:35,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:34:35,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 897 states and 1312 transitions. [2022-04-28 08:34:36,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1312 edges. 1312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:34:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1312 transitions. [2022-04-28 08:34:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 08:34:36,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:34:36,220 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:34:36,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:34:36,220 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:34:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:34:36,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1395645249, now seen corresponding path program 1 times [2022-04-28 08:34:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:34:36,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906471271] [2022-04-28 08:34:54,408 WARN L232 SmtUtils]: Spent 12.59s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:35:06,036 WARN L232 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:35:08,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1395645249, now seen corresponding path program 2 times [2022-04-28 08:35:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:08,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494175849] [2022-04-28 08:35:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:08,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {61831#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {61824#true} is VALID [2022-04-28 08:35:08,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {61824#true} assume true; {61824#true} is VALID [2022-04-28 08:35:08,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61824#true} {61824#true} #592#return; {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {61824#true} call ULTIMATE.init(); {61831#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:35:08,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {61831#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {61824#true} assume true; {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61824#true} {61824#true} #592#return; {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {61824#true} call #t~ret159 := main(); {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {61824#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {61824#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {61824#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {61824#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {61824#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {61824#true} is VALID [2022-04-28 08:35:08,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {61824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {61824#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {61824#true} assume 12292 == #t~mem43;havoc #t~mem43; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {61824#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {61824#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {61824#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {61824#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {61824#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {61824#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {61824#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {61824#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {61824#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {61824#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {61824#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {61824#true} assume 4368 == #t~mem48;havoc #t~mem48; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {61824#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {61824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {61824#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {61824#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {61824#true} is VALID [2022-04-28 08:35:08,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {61824#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {61824#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {61824#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {61824#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {61824#true} assume 4384 == #t~mem50;havoc #t~mem50; {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {61824#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {61824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61824#true} is VALID [2022-04-28 08:35:08,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {61824#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {61824#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {61824#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {61824#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {61824#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {61824#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {61824#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {61824#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {61824#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {61824#true} assume 4400 == #t~mem52;havoc #t~mem52; {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {61824#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {61824#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {61824#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {61824#true} assume !(~ret~0 <= 0); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {61824#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {61824#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 77: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {61824#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {61824#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {61824#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {61824#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {61824#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {61824#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 91: Hoare triple {61824#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {61824#true} assume 4416 == #t~mem54;havoc #t~mem54; {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {61824#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {61824#true} is VALID [2022-04-28 08:35:08,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {61824#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {61824#true} is VALID [2022-04-28 08:35:08,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {61824#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,778 INFO L290 TraceCheckUtils]: 96: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,779 INFO L290 TraceCheckUtils]: 99: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,779 INFO L290 TraceCheckUtils]: 100: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,779 INFO L290 TraceCheckUtils]: 101: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,780 INFO L290 TraceCheckUtils]: 103: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,780 INFO L290 TraceCheckUtils]: 104: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:35:08,780 INFO L290 TraceCheckUtils]: 105: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61830#(not (= |ssl3_connect_#t~mem47| 4099))} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 106: Hoare triple {61830#(not (= |ssl3_connect_#t~mem47| 4099))} assume 4099 == #t~mem47;havoc #t~mem47; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 107: Hoare triple {61825#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 108: Hoare triple {61825#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 109: Hoare triple {61825#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 110: Hoare triple {61825#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 111: Hoare triple {61825#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {61825#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 113: Hoare triple {61825#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 114: Hoare triple {61825#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 115: Hoare triple {61825#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 116: Hoare triple {61825#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 117: Hoare triple {61825#false} ~skip~0 := 0; {61825#false} is VALID [2022-04-28 08:35:08,781 INFO L290 TraceCheckUtils]: 118: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 119: Hoare triple {61825#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 120: Hoare triple {61825#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 121: Hoare triple {61825#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 122: Hoare triple {61825#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 123: Hoare triple {61825#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 124: Hoare triple {61825#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 125: Hoare triple {61825#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 126: Hoare triple {61825#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {61825#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 128: Hoare triple {61825#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 129: Hoare triple {61825#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 130: Hoare triple {61825#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 131: Hoare triple {61825#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,782 INFO L290 TraceCheckUtils]: 132: Hoare triple {61825#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 133: Hoare triple {61825#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 134: Hoare triple {61825#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 135: Hoare triple {61825#false} assume 4448 == #t~mem58;havoc #t~mem58; {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 136: Hoare triple {61825#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 137: Hoare triple {61825#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 138: Hoare triple {61825#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 139: Hoare triple {61825#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 140: Hoare triple {61825#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 141: Hoare triple {61825#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 142: Hoare triple {61825#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 143: Hoare triple {61825#false} ~skip~0 := 0; {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 144: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-28 08:35:08,783 INFO L290 TraceCheckUtils]: 145: Hoare triple {61825#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 146: Hoare triple {61825#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 147: Hoare triple {61825#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 148: Hoare triple {61825#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 149: Hoare triple {61825#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 150: Hoare triple {61825#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 151: Hoare triple {61825#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 152: Hoare triple {61825#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 153: Hoare triple {61825#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 154: Hoare triple {61825#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 155: Hoare triple {61825#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 156: Hoare triple {61825#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 157: Hoare triple {61825#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 158: Hoare triple {61825#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 159: Hoare triple {61825#false} assume 4432 == #t~mem56;havoc #t~mem56; {61825#false} is VALID [2022-04-28 08:35:08,784 INFO L290 TraceCheckUtils]: 160: Hoare triple {61825#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {61825#false} is VALID [2022-04-28 08:35:08,785 INFO L290 TraceCheckUtils]: 161: Hoare triple {61825#false} assume 5 == ~blastFlag~0; {61825#false} is VALID [2022-04-28 08:35:08,785 INFO L290 TraceCheckUtils]: 162: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-28 08:35:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 08:35:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494175849] [2022-04-28 08:35:08,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494175849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:08,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:08,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:08,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906471271] [2022-04-28 08:35:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906471271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:35:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448865445] [2022-04-28 08:35:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:08,786 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 163 [2022-04-28 08:35:08,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:08,787 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-28 08:35:08,863 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-28 08:35:08,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:35:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:35:08,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:35:08,863 INFO L87 Difference]: Start difference. First operand 897 states and 1312 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-28 08:35:10,883 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-28 08:35:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:12,024 INFO L93 Difference]: Finished difference Result 2167 states and 3177 transitions. [2022-04-28 08:35:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:35:12,025 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 163 [2022-04-28 08:35:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:12,025 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-28 08:35:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 08:35:12,027 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-28 08:35:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 08:35:12,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 08:35:12,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:12,386 INFO L225 Difference]: With dead ends: 2167 [2022-04-28 08:35:12,386 INFO L226 Difference]: Without dead ends: 1286 [2022-04-28 08:35:12,387 INFO L412 NwaCegarLoop]: 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-28 08:35:12,387 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 284 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-28 08:35:12,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:35:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-28 08:35:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 907. [2022-04-28 08:35:12,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:12,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1286 states. Second operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:12,434 INFO L74 IsIncluded]: Start isIncluded. First operand 1286 states. Second operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:12,434 INFO L87 Difference]: Start difference. First operand 1286 states. Second operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:12,479 INFO L93 Difference]: Finished difference Result 1286 states and 1871 transitions. [2022-04-28 08:35:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1871 transitions. [2022-04-28 08:35:12,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:12,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:12,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 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 1286 states. [2022-04-28 08:35:12,483 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 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 1286 states. [2022-04-28 08:35:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:12,529 INFO L93 Difference]: Finished difference Result 1286 states and 1871 transitions. [2022-04-28 08:35:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1871 transitions. [2022-04-28 08:35:12,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:12,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:12,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:12,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:35:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1318 transitions. [2022-04-28 08:35:12,568 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1318 transitions. Word has length 163 [2022-04-28 08:35:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:12,569 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1318 transitions. [2022-04-28 08:35:12,569 INFO L496 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-28 08:35:12,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1318 transitions. [2022-04-28 08:35:13,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1318 edges. 1318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1318 transitions. [2022-04-28 08:35:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 08:35:13,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:13,672 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:13,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:35:13,673 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:13,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -863179426, now seen corresponding path program 1 times [2022-04-28 08:35:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:13,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708054354] [2022-04-28 08:35:30,492 WARN L232 SmtUtils]: Spent 16.82s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:35:44,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:35:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -863179426, now seen corresponding path program 2 times [2022-04-28 08:35:44,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:44,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800841653] [2022-04-28 08:35:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:44,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {70564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70556#true} is VALID [2022-04-28 08:35:44,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-28 08:35:44,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {70556#true} call ULTIMATE.init(); {70564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:35:44,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {70564#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {70556#true} call #t~ret159 := main(); {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {70556#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {70556#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {70556#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {70556#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {70556#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {70556#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70556#true} is VALID [2022-04-28 08:35:44,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {70556#true} assume 12292 == #t~mem43;havoc #t~mem43; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {70556#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {70556#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {70556#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {70556#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {70556#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {70556#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {70556#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {70556#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {70556#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-28 08:35:44,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {70556#true} assume 4368 == #t~mem48;havoc #t~mem48; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {70556#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {70556#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {70556#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {70556#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {70556#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-28 08:35:44,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {70556#true} assume 4384 == #t~mem50;havoc #t~mem50; {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {70556#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70556#true} is VALID [2022-04-28 08:35:44,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {70556#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70556#true} is VALID [2022-04-28 08:35:44,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {70556#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70561#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:35:44,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {70561#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,757 INFO L290 TraceCheckUtils]: 59: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,759 INFO L290 TraceCheckUtils]: 65: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem52;havoc #t~mem52; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,761 INFO L290 TraceCheckUtils]: 74: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,762 INFO L290 TraceCheckUtils]: 75: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,762 INFO L290 TraceCheckUtils]: 76: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,763 INFO L290 TraceCheckUtils]: 78: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,763 INFO L290 TraceCheckUtils]: 79: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,763 INFO L290 TraceCheckUtils]: 80: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,763 INFO L290 TraceCheckUtils]: 81: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,764 INFO L290 TraceCheckUtils]: 82: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,764 INFO L290 TraceCheckUtils]: 83: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,765 INFO L290 TraceCheckUtils]: 87: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,765 INFO L290 TraceCheckUtils]: 88: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,766 INFO L290 TraceCheckUtils]: 90: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,766 INFO L290 TraceCheckUtils]: 91: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,766 INFO L290 TraceCheckUtils]: 92: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem54;havoc #t~mem54; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,768 INFO L290 TraceCheckUtils]: 95: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,768 INFO L290 TraceCheckUtils]: 96: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,768 INFO L290 TraceCheckUtils]: 97: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,769 INFO L290 TraceCheckUtils]: 98: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,769 INFO L290 TraceCheckUtils]: 99: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,769 INFO L290 TraceCheckUtils]: 100: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,769 INFO L290 TraceCheckUtils]: 101: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,770 INFO L290 TraceCheckUtils]: 102: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,770 INFO L290 TraceCheckUtils]: 103: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,770 INFO L290 TraceCheckUtils]: 104: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,770 INFO L290 TraceCheckUtils]: 105: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,771 INFO L290 TraceCheckUtils]: 106: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,771 INFO L290 TraceCheckUtils]: 107: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,771 INFO L290 TraceCheckUtils]: 108: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,772 INFO L290 TraceCheckUtils]: 109: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4384 == #t~mem50;havoc #t~mem50; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,772 INFO L290 TraceCheckUtils]: 111: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:35:44,772 INFO L290 TraceCheckUtils]: 112: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70563#(= |ssl3_connect_#t~mem89| 0)} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 113: Hoare triple {70563#(= |ssl3_connect_#t~mem89| 0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 114: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 115: Hoare triple {70557#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 116: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 117: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 118: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 119: Hoare triple {70557#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 120: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 121: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 122: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 123: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,773 INFO L290 TraceCheckUtils]: 124: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 125: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 126: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 127: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 128: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 129: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 130: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 131: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 132: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 133: Hoare triple {70557#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 134: Hoare triple {70557#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 135: Hoare triple {70557#false} assume 4448 == #t~mem58;havoc #t~mem58; {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 136: Hoare triple {70557#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 137: Hoare triple {70557#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 138: Hoare triple {70557#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,774 INFO L290 TraceCheckUtils]: 139: Hoare triple {70557#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 140: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 141: Hoare triple {70557#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 142: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 143: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 144: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 145: Hoare triple {70557#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 146: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 147: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 148: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 149: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 150: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 151: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,775 INFO L290 TraceCheckUtils]: 152: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 153: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 154: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 155: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 156: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 157: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 158: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 159: Hoare triple {70557#false} assume 4432 == #t~mem56;havoc #t~mem56; {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 160: Hoare triple {70557#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 161: Hoare triple {70557#false} assume 5 == ~blastFlag~0; {70557#false} is VALID [2022-04-28 08:35:44,776 INFO L290 TraceCheckUtils]: 162: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-28 08:35:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 229 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-04-28 08:35:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800841653] [2022-04-28 08:35:44,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800841653] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:35:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532572146] [2022-04-28 08:35:44,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:35:44,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:35:44,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:35:44,779 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-28 08:35:44,781 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-28 08:36:21,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:36:21,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:36:21,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 08:36:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:21,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:36:21,520 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:36:21,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 08:36:21,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:36:21,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {70556#true} call ULTIMATE.init(); {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {70556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {70556#true} call #t~ret159 := main(); {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {70556#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {70556#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {70556#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {70556#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {70556#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {70556#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {70556#true} assume 12292 == #t~mem43;havoc #t~mem43; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {70556#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {70556#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {70556#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {70556#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {70556#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {70556#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {70556#true} is VALID [2022-04-28 08:36:21,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {70556#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {70556#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {70556#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {70556#true} assume 4368 == #t~mem48;havoc #t~mem48; {70556#true} is VALID [2022-04-28 08:36:21,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {70556#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {70556#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {70556#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {70556#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {70556#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {70556#true} assume 4384 == #t~mem50;havoc #t~mem50; {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {70556#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {70556#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {70556#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {70556#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {70556#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {70556#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-28 08:36:21,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 66: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 67: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {70556#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {70556#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {70556#true} assume 4400 == #t~mem52;havoc #t~mem52; {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {70556#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {70556#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {70556#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {70556#true} assume !(~ret~0 <= 0); {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {70556#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {70556#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 79: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-28 08:36:21,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {70556#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 82: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 83: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 87: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 88: Hoare triple {70556#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {70556#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 90: Hoare triple {70556#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 91: Hoare triple {70556#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-28 08:36:21,686 INFO L290 TraceCheckUtils]: 92: Hoare triple {70556#true} assume 4416 == #t~mem54;havoc #t~mem54; {70556#true} is VALID [2022-04-28 08:36:21,687 INFO L290 TraceCheckUtils]: 93: Hoare triple {70556#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {70556#true} is VALID [2022-04-28 08:36:21,687 INFO L290 TraceCheckUtils]: 94: Hoare triple {70556#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70556#true} is VALID [2022-04-28 08:36:21,688 INFO L290 TraceCheckUtils]: 95: Hoare triple {70556#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,689 INFO L290 TraceCheckUtils]: 96: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,689 INFO L290 TraceCheckUtils]: 97: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,689 INFO L290 TraceCheckUtils]: 98: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,690 INFO L290 TraceCheckUtils]: 99: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,690 INFO L290 TraceCheckUtils]: 100: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,690 INFO L290 TraceCheckUtils]: 101: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,691 INFO L290 TraceCheckUtils]: 103: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,691 INFO L290 TraceCheckUtils]: 104: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,692 INFO L290 TraceCheckUtils]: 105: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,692 INFO L290 TraceCheckUtils]: 106: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,692 INFO L290 TraceCheckUtils]: 107: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:21,693 INFO L290 TraceCheckUtils]: 108: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70893#(= |ssl3_connect_#t~mem50| 4432)} is VALID [2022-04-28 08:36:21,693 INFO L290 TraceCheckUtils]: 109: Hoare triple {70893#(= |ssl3_connect_#t~mem50| 4432)} assume 4384 == #t~mem50;havoc #t~mem50; {70557#false} is VALID [2022-04-28 08:36:21,693 INFO L290 TraceCheckUtils]: 110: Hoare triple {70557#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70557#false} is VALID [2022-04-28 08:36:21,693 INFO L290 TraceCheckUtils]: 111: Hoare triple {70557#false} assume !(1 == ~blastFlag~0); {70557#false} is VALID [2022-04-28 08:36:21,693 INFO L290 TraceCheckUtils]: 112: Hoare triple {70557#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 113: Hoare triple {70557#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 114: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 115: Hoare triple {70557#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 116: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 117: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 118: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 119: Hoare triple {70557#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 120: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 121: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 122: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,694 INFO L290 TraceCheckUtils]: 123: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,695 INFO L290 TraceCheckUtils]: 124: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,695 INFO L290 TraceCheckUtils]: 125: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 126: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 127: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 128: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 129: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 130: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 131: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 132: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 133: Hoare triple {70557#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 134: Hoare triple {70557#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 135: Hoare triple {70557#false} assume 4448 == #t~mem58;havoc #t~mem58; {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 136: Hoare triple {70557#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 137: Hoare triple {70557#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70557#false} is VALID [2022-04-28 08:36:21,696 INFO L290 TraceCheckUtils]: 138: Hoare triple {70557#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 139: Hoare triple {70557#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 140: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 141: Hoare triple {70557#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 142: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 143: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 144: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 145: Hoare triple {70557#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,697 INFO L290 TraceCheckUtils]: 146: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,698 INFO L290 TraceCheckUtils]: 147: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,698 INFO L290 TraceCheckUtils]: 148: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,698 INFO L290 TraceCheckUtils]: 149: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,698 INFO L290 TraceCheckUtils]: 150: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,698 INFO L290 TraceCheckUtils]: 151: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,703 INFO L290 TraceCheckUtils]: 152: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,704 INFO L290 TraceCheckUtils]: 153: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,704 INFO L290 TraceCheckUtils]: 154: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,705 INFO L290 TraceCheckUtils]: 155: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,708 INFO L290 TraceCheckUtils]: 156: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,708 INFO L290 TraceCheckUtils]: 157: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,711 INFO L290 TraceCheckUtils]: 158: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-28 08:36:21,711 INFO L290 TraceCheckUtils]: 159: Hoare triple {70557#false} assume 4432 == #t~mem56;havoc #t~mem56; {70557#false} is VALID [2022-04-28 08:36:21,711 INFO L290 TraceCheckUtils]: 160: Hoare triple {70557#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {70557#false} is VALID [2022-04-28 08:36:21,711 INFO L290 TraceCheckUtils]: 161: Hoare triple {70557#false} assume 5 == ~blastFlag~0; {70557#false} is VALID [2022-04-28 08:36:21,711 INFO L290 TraceCheckUtils]: 162: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-28 08:36:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 08:36:21,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:36:21,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532572146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:21,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 08:36:21,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-04-28 08:36:21,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:36:21,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708054354] [2022-04-28 08:36:21,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708054354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:36:21,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:36:21,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:36:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589666386] [2022-04-28 08:36:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:36:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-04-28 08:36:21,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:36:21,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:21,786 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-28 08:36:21,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:36:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:36:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:36:21,787 INFO L87 Difference]: Start difference. First operand 907 states and 1318 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:25,828 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-28 08:36:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:28,581 INFO L93 Difference]: Finished difference Result 1873 states and 2703 transitions. [2022-04-28 08:36:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:36:28,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-04-28 08:36:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:36:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2022-04-28 08:36:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2022-04-28 08:36:28,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 399 transitions. [2022-04-28 08:36:28,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:28,857 INFO L225 Difference]: With dead ends: 1873 [2022-04-28 08:36:28,857 INFO L226 Difference]: Without dead ends: 982 [2022-04-28 08:36:28,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:36:28,859 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 41 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:36:28,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 511 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 08:36:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-28 08:36:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 907. [2022-04-28 08:36:28,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:36:28,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:28,900 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:28,900 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:28,929 INFO L93 Difference]: Finished difference Result 982 states and 1401 transitions. [2022-04-28 08:36:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2022-04-28 08:36:28,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:28,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:28,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 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 982 states. [2022-04-28 08:36:28,933 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 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 982 states. [2022-04-28 08:36:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:36:28,964 INFO L93 Difference]: Finished difference Result 982 states and 1401 transitions. [2022-04-28 08:36:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2022-04-28 08:36:28,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:36:28,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:36:28,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:36:28,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:36:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1314 transitions. [2022-04-28 08:36:29,002 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1314 transitions. Word has length 163 [2022-04-28 08:36:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:36:29,003 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1314 transitions. [2022-04-28 08:36:29,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:36:29,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1314 transitions. [2022-04-28 08:36:30,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1314 edges. 1314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:36:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1314 transitions. [2022-04-28 08:36:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 08:36:30,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:36:30,073 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:36:30,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 08:36:30,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 08:36:30,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:36:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:36:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1898118871, now seen corresponding path program 1 times [2022-04-28 08:36:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:36:30,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193996645] [2022-04-28 08:36:42,034 WARN L232 SmtUtils]: Spent 11.76s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:36:50,904 WARN L232 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:36:57,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:36:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1898118871, now seen corresponding path program 2 times [2022-04-28 08:36:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:36:57,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137515255] [2022-04-28 08:36:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:36:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:36:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:36:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:36:57,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {78589#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {78581#true} is VALID [2022-04-28 08:36:57,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-28 08:36:57,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {78581#true} call ULTIMATE.init(); {78589#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:36:57,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {78589#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {78581#true} call #t~ret159 := main(); {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {78581#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {78581#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {78581#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {78581#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {78581#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {78581#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:36:57,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {78581#true} assume 12292 == #t~mem43;havoc #t~mem43; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {78581#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {78581#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {78581#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {78581#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {78581#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {78581#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {78581#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {78581#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {78581#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {78581#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:36:57,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {78581#true} assume 4368 == #t~mem48;havoc #t~mem48; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {78581#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {78581#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {78581#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {78581#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {78581#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:36:57,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {78581#true} assume 4384 == #t~mem50;havoc #t~mem50; {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {78581#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78581#true} is VALID [2022-04-28 08:36:57,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {78581#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78581#true} is VALID [2022-04-28 08:36:57,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {78581#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78586#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:36:57,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {78586#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,392 INFO L290 TraceCheckUtils]: 64: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem52;havoc #t~mem52; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,394 INFO L290 TraceCheckUtils]: 71: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,396 INFO L290 TraceCheckUtils]: 75: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,396 INFO L290 TraceCheckUtils]: 76: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,396 INFO L290 TraceCheckUtils]: 77: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,397 INFO L290 TraceCheckUtils]: 78: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,397 INFO L290 TraceCheckUtils]: 79: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,397 INFO L290 TraceCheckUtils]: 80: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,397 INFO L290 TraceCheckUtils]: 81: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,398 INFO L290 TraceCheckUtils]: 82: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,398 INFO L290 TraceCheckUtils]: 83: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,398 INFO L290 TraceCheckUtils]: 84: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,398 INFO L290 TraceCheckUtils]: 85: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,399 INFO L290 TraceCheckUtils]: 86: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,399 INFO L290 TraceCheckUtils]: 87: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,399 INFO L290 TraceCheckUtils]: 88: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,400 INFO L290 TraceCheckUtils]: 90: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,400 INFO L290 TraceCheckUtils]: 91: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,400 INFO L290 TraceCheckUtils]: 92: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem54;havoc #t~mem54; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,401 INFO L290 TraceCheckUtils]: 93: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,401 INFO L290 TraceCheckUtils]: 94: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,402 INFO L290 TraceCheckUtils]: 95: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,402 INFO L290 TraceCheckUtils]: 96: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,409 INFO L290 TraceCheckUtils]: 97: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,409 INFO L290 TraceCheckUtils]: 98: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,410 INFO L290 TraceCheckUtils]: 99: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,410 INFO L290 TraceCheckUtils]: 101: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,410 INFO L290 TraceCheckUtils]: 102: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,411 INFO L290 TraceCheckUtils]: 103: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,411 INFO L290 TraceCheckUtils]: 104: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,411 INFO L290 TraceCheckUtils]: 105: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,411 INFO L290 TraceCheckUtils]: 106: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,412 INFO L290 TraceCheckUtils]: 107: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,412 INFO L290 TraceCheckUtils]: 108: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,412 INFO L290 TraceCheckUtils]: 109: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,412 INFO L290 TraceCheckUtils]: 110: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4385 == #t~mem51;havoc #t~mem51; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 08:36:57,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78588#(= |ssl3_connect_#t~mem89| 0)} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 114: Hoare triple {78588#(= |ssl3_connect_#t~mem89| 0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 115: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 116: Hoare triple {78582#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 117: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 118: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 119: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 120: Hoare triple {78582#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 121: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 122: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 123: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,414 INFO L290 TraceCheckUtils]: 124: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 125: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 126: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 127: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 128: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 129: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 130: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 131: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 132: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 133: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 134: Hoare triple {78582#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 135: Hoare triple {78582#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 136: Hoare triple {78582#false} assume 4448 == #t~mem58;havoc #t~mem58; {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 137: Hoare triple {78582#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {78582#false} is VALID [2022-04-28 08:36:57,415 INFO L290 TraceCheckUtils]: 138: Hoare triple {78582#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 139: Hoare triple {78582#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 140: Hoare triple {78582#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 141: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 142: Hoare triple {78582#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 143: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 144: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 145: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 146: Hoare triple {78582#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 147: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 148: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 149: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 150: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 151: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,416 INFO L290 TraceCheckUtils]: 152: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 153: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 154: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 155: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 156: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 157: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 158: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 159: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 160: Hoare triple {78582#false} assume 4432 == #t~mem56;havoc #t~mem56; {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 161: Hoare triple {78582#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 162: Hoare triple {78582#false} assume 5 == ~blastFlag~0; {78582#false} is VALID [2022-04-28 08:36:57,417 INFO L290 TraceCheckUtils]: 163: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-28 08:36:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 231 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 08:36:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:36:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137515255] [2022-04-28 08:36:57,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137515255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:36:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738848701] [2022-04-28 08:36:57,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:36:57,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:36:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:36:57,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:36:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 08:38:27,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:38:27,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:38:27,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 08:38:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:38:27,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:38:27,441 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 08:38:27,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 08:38:27,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 08:38:27,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {78581#true} call ULTIMATE.init(); {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {78581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {78581#true} call #t~ret159 := main(); {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {78581#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L272 TraceCheckUtils]: 6: Hoare triple {78581#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {78581#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {78581#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {78581#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {78581#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:38:27,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {78581#true} assume 12292 == #t~mem43;havoc #t~mem43; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {78581#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {78581#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {78581#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {78581#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {78581#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {78581#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {78581#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {78581#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {78581#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {78581#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-28 08:38:27,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {78581#true} assume 4368 == #t~mem48;havoc #t~mem48; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {78581#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {78581#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {78581#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {78581#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {78581#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-28 08:38:27,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {78581#true} assume 4384 == #t~mem50;havoc #t~mem50; {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {78581#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {78581#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {78581#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {78581#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {78581#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {78581#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {78581#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {78581#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {78581#true} assume 4400 == #t~mem52;havoc #t~mem52; {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {78581#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 72: Hoare triple {78581#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {78581#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {78581#true} assume !(~ret~0 <= 0); {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {78581#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {78581#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {78581#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 87: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {78581#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {78581#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {78581#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {78581#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {78581#true} assume 4416 == #t~mem54;havoc #t~mem54; {78581#true} is VALID [2022-04-28 08:38:27,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {78581#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {78581#true} is VALID [2022-04-28 08:38:27,579 INFO L290 TraceCheckUtils]: 94: Hoare triple {78581#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {78581#true} is VALID [2022-04-28 08:38:27,580 INFO L290 TraceCheckUtils]: 95: Hoare triple {78581#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,580 INFO L290 TraceCheckUtils]: 96: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,580 INFO L290 TraceCheckUtils]: 97: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,581 INFO L290 TraceCheckUtils]: 99: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,582 INFO L290 TraceCheckUtils]: 104: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,582 INFO L290 TraceCheckUtils]: 105: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,583 INFO L290 TraceCheckUtils]: 106: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,583 INFO L290 TraceCheckUtils]: 107: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,583 INFO L290 TraceCheckUtils]: 108: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:38:27,583 INFO L290 TraceCheckUtils]: 109: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78921#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 110: Hoare triple {78921#(= |ssl3_connect_#t~mem51| 4432)} assume 4385 == #t~mem51;havoc #t~mem51; {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 111: Hoare triple {78582#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 112: Hoare triple {78582#false} assume !(1 == ~blastFlag~0); {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 113: Hoare triple {78582#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 114: Hoare triple {78582#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 115: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 116: Hoare triple {78582#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 117: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 118: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 119: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-28 08:38:27,584 INFO L290 TraceCheckUtils]: 120: Hoare triple {78582#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 121: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 122: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 123: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 124: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 125: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 126: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 127: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 128: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 129: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 130: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 131: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 132: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 133: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,585 INFO L290 TraceCheckUtils]: 134: Hoare triple {78582#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 135: Hoare triple {78582#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 136: Hoare triple {78582#false} assume 4448 == #t~mem58;havoc #t~mem58; {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 137: Hoare triple {78582#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 138: Hoare triple {78582#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 139: Hoare triple {78582#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 140: Hoare triple {78582#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 141: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 142: Hoare triple {78582#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 143: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 144: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 145: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 146: Hoare triple {78582#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 147: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 148: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,586 INFO L290 TraceCheckUtils]: 149: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 150: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 151: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 152: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 153: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 154: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 155: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 156: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 157: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 158: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 159: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 160: Hoare triple {78582#false} assume 4432 == #t~mem56;havoc #t~mem56; {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 161: Hoare triple {78582#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 162: Hoare triple {78582#false} assume 5 == ~blastFlag~0; {78582#false} is VALID [2022-04-28 08:38:27,587 INFO L290 TraceCheckUtils]: 163: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-28 08:38:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 08:38:27,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:38:27,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738848701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:27,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 08:38:27,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-04-28 08:38:27,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:38:27,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193996645] [2022-04-28 08:38:27,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193996645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:38:27,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:38:27,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:38:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057028741] [2022-04-28 08:38:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:38:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-28 08:38:27,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:38:27,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:27,670 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-28 08:38:27,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:38:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:38:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:38:27,671 INFO L87 Difference]: Start difference. First operand 907 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:33,732 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-28 08:38:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:34,417 INFO L93 Difference]: Finished difference Result 1857 states and 2674 transitions. [2022-04-28 08:38:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:38:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-28 08:38:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:38:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-04-28 08:38:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-04-28 08:38:34,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 392 transitions. [2022-04-28 08:38:34,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:34,686 INFO L225 Difference]: With dead ends: 1857 [2022-04-28 08:38:34,686 INFO L226 Difference]: Without dead ends: 966 [2022-04-28 08:38:34,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:38:34,688 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 35 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:38:34,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 503 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 08:38:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-04-28 08:38:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 907. [2022-04-28 08:38:34,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:38:34,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 966 states. Second operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,725 INFO L74 IsIncluded]: Start isIncluded. First operand 966 states. Second operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,726 INFO L87 Difference]: Start difference. First operand 966 states. Second operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:34,754 INFO L93 Difference]: Finished difference Result 966 states and 1376 transitions. [2022-04-28 08:38:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2022-04-28 08:38:34,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:34,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:34,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 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 966 states. [2022-04-28 08:38:34,757 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 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 966 states. [2022-04-28 08:38:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:38:34,785 INFO L93 Difference]: Finished difference Result 966 states and 1376 transitions. [2022-04-28 08:38:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2022-04-28 08:38:34,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:38:34,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:38:34,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:38:34,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:38:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1310 transitions. [2022-04-28 08:38:34,825 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1310 transitions. Word has length 164 [2022-04-28 08:38:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:38:34,825 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1310 transitions. [2022-04-28 08:38:34,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:38:34,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1310 transitions. [2022-04-28 08:38:35,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1310 edges. 1310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:38:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1310 transitions. [2022-04-28 08:38:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 08:38:35,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:38:35,917 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:38:35,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 08:38:36,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:38:36,119 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:38:36,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:38:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1024644139, now seen corresponding path program 1 times [2022-04-28 08:38:36,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:38:36,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1136084024] [2022-04-28 08:38:50,210 WARN L232 SmtUtils]: Spent 14.09s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:38:58,992 WARN L232 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:05,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1024644139, now seen corresponding path program 2 times [2022-04-28 08:39:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:05,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397498687] [2022-04-28 08:39:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:05,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {86552#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {86545#true} is VALID [2022-04-28 08:39:05,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {86545#true} assume true; {86545#true} is VALID [2022-04-28 08:39:05,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86545#true} {86545#true} #592#return; {86545#true} is VALID [2022-04-28 08:39:05,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {86545#true} call ULTIMATE.init(); {86552#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:39:05,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {86552#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {86545#true} is VALID [2022-04-28 08:39:05,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {86545#true} assume true; {86545#true} is VALID [2022-04-28 08:39:05,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86545#true} {86545#true} #592#return; {86545#true} is VALID [2022-04-28 08:39:05,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {86545#true} call #t~ret159 := main(); {86545#true} is VALID [2022-04-28 08:39:05,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {86545#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {86545#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {86545#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {86545#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {86545#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {86545#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {86545#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {86545#true} assume 12292 == #t~mem43;havoc #t~mem43; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {86545#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {86545#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {86545#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {86545#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {86545#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {86545#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {86545#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {86545#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {86545#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {86545#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {86545#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {86545#true} assume 4368 == #t~mem48;havoc #t~mem48; {86545#true} is VALID [2022-04-28 08:39:05,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {86545#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {86545#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {86545#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {86545#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {86545#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {86545#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {86545#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {86545#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {86545#true} assume 4384 == #t~mem50;havoc #t~mem50; {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {86545#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {86545#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {86545#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {86545#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {86545#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {86545#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {86545#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {86545#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {86545#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {86545#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {86545#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {86545#true} assume 4400 == #t~mem52;havoc #t~mem52; {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {86545#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {86545#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {86545#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {86545#true} assume !(~ret~0 <= 0); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {86545#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {86545#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-28 08:39:05,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {86545#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 83: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 84: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {86545#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 87: Hoare triple {86545#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 88: Hoare triple {86545#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {86545#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 90: Hoare triple {86545#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {86545#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-28 08:39:05,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {86545#true} assume 4416 == #t~mem54;havoc #t~mem54; {86545#true} is VALID [2022-04-28 08:39:05,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {86545#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {86545#true} is VALID [2022-04-28 08:39:05,379 INFO L290 TraceCheckUtils]: 94: Hoare triple {86545#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86545#true} is VALID [2022-04-28 08:39:05,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {86545#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,380 INFO L290 TraceCheckUtils]: 97: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,381 INFO L290 TraceCheckUtils]: 99: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,381 INFO L290 TraceCheckUtils]: 100: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,381 INFO L290 TraceCheckUtils]: 101: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,381 INFO L290 TraceCheckUtils]: 102: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,382 INFO L290 TraceCheckUtils]: 103: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,383 INFO L290 TraceCheckUtils]: 107: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:05,384 INFO L290 TraceCheckUtils]: 111: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86551#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-28 08:39:05,384 INFO L290 TraceCheckUtils]: 112: Hoare triple {86551#(= |ssl3_connect_#t~mem53| 4432)} assume 4401 == #t~mem53;havoc #t~mem53; {86546#false} is VALID [2022-04-28 08:39:05,384 INFO L290 TraceCheckUtils]: 113: Hoare triple {86546#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,384 INFO L290 TraceCheckUtils]: 114: Hoare triple {86546#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {86546#false} is VALID [2022-04-28 08:39:05,384 INFO L290 TraceCheckUtils]: 115: Hoare triple {86546#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 116: Hoare triple {86546#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 117: Hoare triple {86546#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 118: Hoare triple {86546#false} ~skip~0 := 0; {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 119: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 120: Hoare triple {86546#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 121: Hoare triple {86546#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 122: Hoare triple {86546#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 123: Hoare triple {86546#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 124: Hoare triple {86546#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 125: Hoare triple {86546#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 126: Hoare triple {86546#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 127: Hoare triple {86546#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 128: Hoare triple {86546#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 129: Hoare triple {86546#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,385 INFO L290 TraceCheckUtils]: 130: Hoare triple {86546#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 131: Hoare triple {86546#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 132: Hoare triple {86546#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 133: Hoare triple {86546#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 134: Hoare triple {86546#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 135: Hoare triple {86546#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 136: Hoare triple {86546#false} assume 4448 == #t~mem58;havoc #t~mem58; {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 137: Hoare triple {86546#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 138: Hoare triple {86546#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 139: Hoare triple {86546#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 140: Hoare triple {86546#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 141: Hoare triple {86546#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 142: Hoare triple {86546#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 143: Hoare triple {86546#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 144: Hoare triple {86546#false} ~skip~0 := 0; {86546#false} is VALID [2022-04-28 08:39:05,386 INFO L290 TraceCheckUtils]: 145: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 146: Hoare triple {86546#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 147: Hoare triple {86546#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 148: Hoare triple {86546#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 149: Hoare triple {86546#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 150: Hoare triple {86546#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 151: Hoare triple {86546#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 152: Hoare triple {86546#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 153: Hoare triple {86546#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 154: Hoare triple {86546#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 155: Hoare triple {86546#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 156: Hoare triple {86546#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 157: Hoare triple {86546#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 158: Hoare triple {86546#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,387 INFO L290 TraceCheckUtils]: 159: Hoare triple {86546#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-28 08:39:05,388 INFO L290 TraceCheckUtils]: 160: Hoare triple {86546#false} assume 4432 == #t~mem56;havoc #t~mem56; {86546#false} is VALID [2022-04-28 08:39:05,388 INFO L290 TraceCheckUtils]: 161: Hoare triple {86546#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {86546#false} is VALID [2022-04-28 08:39:05,388 INFO L290 TraceCheckUtils]: 162: Hoare triple {86546#false} assume 5 == ~blastFlag~0; {86546#false} is VALID [2022-04-28 08:39:05,388 INFO L290 TraceCheckUtils]: 163: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-28 08:39:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 08:39:05,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:05,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397498687] [2022-04-28 08:39:05,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397498687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:05,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:05,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:05,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:05,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1136084024] [2022-04-28 08:39:05,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1136084024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:05,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:05,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602599238] [2022-04-28 08:39:05,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:05,390 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 164 [2022-04-28 08:39:05,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:05,390 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-28 08:39:05,463 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-28 08:39:05,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:05,466 INFO L87 Difference]: Start difference. First operand 907 states and 1310 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-28 08:39:07,486 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-28 08:39:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:08,504 INFO L93 Difference]: Finished difference Result 1836 states and 2640 transitions. [2022-04-28 08:39:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:08,504 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 164 [2022-04-28 08:39:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:08,505 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-28 08:39:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-28 08:39:08,507 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-28 08:39:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-28 08:39:08,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-28 08:39:08,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:08,769 INFO L225 Difference]: With dead ends: 1836 [2022-04-28 08:39:08,769 INFO L226 Difference]: Without dead ends: 945 [2022-04-28 08:39:08,770 INFO L412 NwaCegarLoop]: 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-28 08:39:08,770 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 26 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:08,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 487 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:39:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-04-28 08:39:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 907. [2022-04-28 08:39:08,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:08,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 945 states. Second operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:08,807 INFO L74 IsIncluded]: Start isIncluded. First operand 945 states. Second operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:08,808 INFO L87 Difference]: Start difference. First operand 945 states. Second operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:08,835 INFO L93 Difference]: Finished difference Result 945 states and 1346 transitions. [2022-04-28 08:39:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1346 transitions. [2022-04-28 08:39:08,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:08,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:08,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 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 945 states. [2022-04-28 08:39:08,838 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 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 945 states. [2022-04-28 08:39:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:08,865 INFO L93 Difference]: Finished difference Result 945 states and 1346 transitions. [2022-04-28 08:39:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1346 transitions. [2022-04-28 08:39:08,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:08,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:08,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:08,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1306 transitions. [2022-04-28 08:39:08,904 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1306 transitions. Word has length 164 [2022-04-28 08:39:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:08,904 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1306 transitions. [2022-04-28 08:39:08,904 INFO L496 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-28 08:39:08,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1306 transitions. [2022-04-28 08:39:10,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1306 edges. 1306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1306 transitions. [2022-04-28 08:39:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 08:39:10,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:10,019 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:10,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:39:10,019 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -225241884, now seen corresponding path program 1 times [2022-04-28 08:39:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:10,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373662185] [2022-04-28 08:39:10,020 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -225241884, now seen corresponding path program 2 times [2022-04-28 08:39:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:10,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924771213] [2022-04-28 08:39:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:10,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:10,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {93940#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {93933#true} is VALID [2022-04-28 08:39:10,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {93933#true} assume true; {93933#true} is VALID [2022-04-28 08:39:10,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93933#true} {93933#true} #592#return; {93933#true} is VALID [2022-04-28 08:39:10,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {93933#true} call ULTIMATE.init(); {93940#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:39:10,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {93940#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {93933#true} is VALID [2022-04-28 08:39:10,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {93933#true} assume true; {93933#true} is VALID [2022-04-28 08:39:10,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93933#true} {93933#true} #592#return; {93933#true} is VALID [2022-04-28 08:39:10,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {93933#true} call #t~ret159 := main(); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {93933#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L272 TraceCheckUtils]: 6: Hoare triple {93933#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {93933#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {93933#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {93933#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {93933#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {93933#true} assume 12292 == #t~mem43;havoc #t~mem43; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {93933#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {93933#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {93933#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {93933#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {93933#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {93933#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {93933#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {93933#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {93933#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {93933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {93933#true} assume 4368 == #t~mem48;havoc #t~mem48; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {93933#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {93933#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {93933#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {93933#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {93933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {93933#true} assume 4384 == #t~mem50;havoc #t~mem50; {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {93933#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {93933#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {93933#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {93933#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 55: Hoare triple {93933#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {93933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 61: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 62: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,245 INFO L290 TraceCheckUtils]: 63: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 66: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 67: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 68: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {93933#true} assume 4400 == #t~mem52;havoc #t~mem52; {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {93933#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {93933#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {93933#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {93933#true} assume !(~ret~0 <= 0); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {93933#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {93933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 77: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-28 08:39:10,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 79: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 80: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 81: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 82: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 84: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 85: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 90: Hoare triple {93933#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {93933#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {93933#true} assume 4416 == #t~mem54;havoc #t~mem54; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 93: Hoare triple {93933#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 94: Hoare triple {93933#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 95: Hoare triple {93933#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {93933#true} assume !(0 == ~tmp___6~0); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 97: Hoare triple {93933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 98: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 99: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 100: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 101: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 102: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 103: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 104: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 105: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 106: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,248 INFO L290 TraceCheckUtils]: 107: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 108: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 109: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 110: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 111: Hoare triple {93933#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 112: Hoare triple {93933#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 113: Hoare triple {93933#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 114: Hoare triple {93933#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 115: Hoare triple {93933#true} assume 4432 == #t~mem56;havoc #t~mem56; {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 116: Hoare triple {93933#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 117: Hoare triple {93933#true} assume !(5 == ~blastFlag~0); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 118: Hoare triple {93933#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 119: Hoare triple {93933#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 120: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-28 08:39:10,249 INFO L290 TraceCheckUtils]: 121: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 122: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 123: Hoare triple {93933#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 124: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 125: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 126: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 127: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 128: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 129: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 130: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 131: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 132: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 133: Hoare triple {93933#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 134: Hoare triple {93933#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 135: Hoare triple {93933#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,250 INFO L290 TraceCheckUtils]: 136: Hoare triple {93933#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,251 INFO L290 TraceCheckUtils]: 137: Hoare triple {93933#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,251 INFO L290 TraceCheckUtils]: 138: Hoare triple {93933#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,251 INFO L290 TraceCheckUtils]: 139: Hoare triple {93933#true} assume 4448 == #t~mem58;havoc #t~mem58; {93933#true} is VALID [2022-04-28 08:39:10,251 INFO L290 TraceCheckUtils]: 140: Hoare triple {93933#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {93933#true} is VALID [2022-04-28 08:39:10,251 INFO L290 TraceCheckUtils]: 141: Hoare triple {93933#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {93933#true} is VALID [2022-04-28 08:39:10,251 INFO L290 TraceCheckUtils]: 142: Hoare triple {93933#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {93933#true} is VALID [2022-04-28 08:39:10,252 INFO L290 TraceCheckUtils]: 143: Hoare triple {93933#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,252 INFO L290 TraceCheckUtils]: 144: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,253 INFO L290 TraceCheckUtils]: 145: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,253 INFO L290 TraceCheckUtils]: 146: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,253 INFO L290 TraceCheckUtils]: 147: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,253 INFO L290 TraceCheckUtils]: 148: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,253 INFO L290 TraceCheckUtils]: 149: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,254 INFO L290 TraceCheckUtils]: 150: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,254 INFO L290 TraceCheckUtils]: 151: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,254 INFO L290 TraceCheckUtils]: 152: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,254 INFO L290 TraceCheckUtils]: 153: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,255 INFO L290 TraceCheckUtils]: 154: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,271 INFO L290 TraceCheckUtils]: 155: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,271 INFO L290 TraceCheckUtils]: 156: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,272 INFO L290 TraceCheckUtils]: 157: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,272 INFO L290 TraceCheckUtils]: 158: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,272 INFO L290 TraceCheckUtils]: 159: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,273 INFO L290 TraceCheckUtils]: 160: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,273 INFO L290 TraceCheckUtils]: 161: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:10,273 INFO L290 TraceCheckUtils]: 162: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93939#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-28 08:39:10,274 INFO L290 TraceCheckUtils]: 163: Hoare triple {93939#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {93934#false} is VALID [2022-04-28 08:39:10,274 INFO L290 TraceCheckUtils]: 164: Hoare triple {93934#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {93934#false} is VALID [2022-04-28 08:39:10,274 INFO L290 TraceCheckUtils]: 165: Hoare triple {93934#false} assume 5 == ~blastFlag~0; {93934#false} is VALID [2022-04-28 08:39:10,274 INFO L290 TraceCheckUtils]: 166: Hoare triple {93934#false} assume !false; {93934#false} is VALID [2022-04-28 08:39:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:39:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:10,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924771213] [2022-04-28 08:39:10,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924771213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:10,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:10,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:10,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:10,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373662185] [2022-04-28 08:39:10,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373662185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:10,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:10,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362407078] [2022-04-28 08:39:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 167 [2022-04-28 08:39:10,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:10,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:10,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:10,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:10,342 INFO L87 Difference]: Start difference. First operand 907 states and 1306 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:12,362 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-28 08:39:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:13,501 INFO L93 Difference]: Finished difference Result 2177 states and 3145 transitions. [2022-04-28 08:39:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 167 [2022-04-28 08:39:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:39:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:39:13,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 08:39:13,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:13,866 INFO L225 Difference]: With dead ends: 2177 [2022-04-28 08:39:13,866 INFO L226 Difference]: Without dead ends: 1286 [2022-04-28 08:39:13,867 INFO L412 NwaCegarLoop]: 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-28 08:39:13,867 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:13,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 285 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:39:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-28 08:39:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 952. [2022-04-28 08:39:13,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:13,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1286 states. Second operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 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-28 08:39:13,910 INFO L74 IsIncluded]: Start isIncluded. First operand 1286 states. Second operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 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-28 08:39:13,911 INFO L87 Difference]: Start difference. First operand 1286 states. Second operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 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-28 08:39:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:13,956 INFO L93 Difference]: Finished difference Result 1286 states and 1854 transitions. [2022-04-28 08:39:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1854 transitions. [2022-04-28 08:39:13,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:13,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:13,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 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 1286 states. [2022-04-28 08:39:13,959 INFO L87 Difference]: Start difference. First operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 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 1286 states. [2022-04-28 08:39:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:14,005 INFO L93 Difference]: Finished difference Result 1286 states and 1854 transitions. [2022-04-28 08:39:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1854 transitions. [2022-04-28 08:39:14,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:14,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:14,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:14,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 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-28 08:39:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1391 transitions. [2022-04-28 08:39:14,047 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1391 transitions. Word has length 167 [2022-04-28 08:39:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:14,047 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1391 transitions. [2022-04-28 08:39:14,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:14,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 952 states and 1391 transitions. [2022-04-28 08:39:15,238 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-28 08:39:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1391 transitions. [2022-04-28 08:39:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-28 08:39:15,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:15,239 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:15,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:39:15,240 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1603018293, now seen corresponding path program 1 times [2022-04-28 08:39:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:15,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002678642] [2022-04-28 08:39:15,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1603018293, now seen corresponding path program 2 times [2022-04-28 08:39:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:15,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038907221] [2022-04-28 08:39:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:15,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {102782#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {102775#true} is VALID [2022-04-28 08:39:15,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {102775#true} assume true; {102775#true} is VALID [2022-04-28 08:39:15,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102775#true} {102775#true} #592#return; {102775#true} is VALID [2022-04-28 08:39:15,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {102775#true} call ULTIMATE.init(); {102782#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:39:15,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {102782#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {102775#true} is VALID [2022-04-28 08:39:15,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {102775#true} assume true; {102775#true} is VALID [2022-04-28 08:39:15,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102775#true} {102775#true} #592#return; {102775#true} is VALID [2022-04-28 08:39:15,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {102775#true} call #t~ret159 := main(); {102775#true} is VALID [2022-04-28 08:39:15,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {102775#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {102775#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {102775#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {102775#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {102775#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {102775#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {102775#true} assume 12292 == #t~mem43;havoc #t~mem43; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {102775#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {102775#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {102775#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {102775#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {102775#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {102775#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {102775#true} is VALID [2022-04-28 08:39:15,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {102775#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {102775#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {102775#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {102775#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {102775#true} assume 4368 == #t~mem48;havoc #t~mem48; {102775#true} is VALID [2022-04-28 08:39:15,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {102775#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {102775#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {102775#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {102775#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {102775#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {102775#true} assume 4384 == #t~mem50;havoc #t~mem50; {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {102775#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {102775#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {102775#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {102775#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {102775#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {102775#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {102775#true} assume 4400 == #t~mem52;havoc #t~mem52; {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {102775#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {102775#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {102775#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {102775#true} assume !(~ret~0 <= 0); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {102775#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 76: Hoare triple {102775#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-28 08:39:15,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 80: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 83: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 84: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 85: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 86: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 87: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {102775#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {102775#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {102775#true} assume 4416 == #t~mem54;havoc #t~mem54; {102775#true} is VALID [2022-04-28 08:39:15,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {102775#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 94: Hoare triple {102775#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {102775#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {102775#true} assume !(0 == ~tmp___6~0); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {102775#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 98: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 99: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 101: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 102: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 103: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 104: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 105: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 106: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,410 INFO L290 TraceCheckUtils]: 107: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 108: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 109: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 110: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 111: Hoare triple {102775#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 112: Hoare triple {102775#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 113: Hoare triple {102775#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 114: Hoare triple {102775#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 115: Hoare triple {102775#true} assume 4432 == #t~mem56;havoc #t~mem56; {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 116: Hoare triple {102775#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 117: Hoare triple {102775#true} assume !(5 == ~blastFlag~0); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 118: Hoare triple {102775#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 119: Hoare triple {102775#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 120: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 121: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-28 08:39:15,411 INFO L290 TraceCheckUtils]: 122: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 123: Hoare triple {102775#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 124: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 125: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 126: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 127: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 128: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 129: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 130: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 131: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 132: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 133: Hoare triple {102775#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 134: Hoare triple {102775#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 135: Hoare triple {102775#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,412 INFO L290 TraceCheckUtils]: 136: Hoare triple {102775#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,413 INFO L290 TraceCheckUtils]: 137: Hoare triple {102775#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,413 INFO L290 TraceCheckUtils]: 138: Hoare triple {102775#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,413 INFO L290 TraceCheckUtils]: 139: Hoare triple {102775#true} assume 4448 == #t~mem58;havoc #t~mem58; {102775#true} is VALID [2022-04-28 08:39:15,413 INFO L290 TraceCheckUtils]: 140: Hoare triple {102775#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {102775#true} is VALID [2022-04-28 08:39:15,413 INFO L290 TraceCheckUtils]: 141: Hoare triple {102775#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102775#true} is VALID [2022-04-28 08:39:15,413 INFO L290 TraceCheckUtils]: 142: Hoare triple {102775#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {102775#true} is VALID [2022-04-28 08:39:15,414 INFO L290 TraceCheckUtils]: 143: Hoare triple {102775#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,414 INFO L290 TraceCheckUtils]: 144: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,415 INFO L290 TraceCheckUtils]: 145: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,415 INFO L290 TraceCheckUtils]: 146: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,415 INFO L290 TraceCheckUtils]: 147: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,415 INFO L290 TraceCheckUtils]: 148: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,416 INFO L290 TraceCheckUtils]: 149: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,416 INFO L290 TraceCheckUtils]: 150: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,416 INFO L290 TraceCheckUtils]: 151: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,417 INFO L290 TraceCheckUtils]: 152: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,417 INFO L290 TraceCheckUtils]: 153: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,417 INFO L290 TraceCheckUtils]: 154: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,418 INFO L290 TraceCheckUtils]: 155: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,418 INFO L290 TraceCheckUtils]: 156: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,418 INFO L290 TraceCheckUtils]: 157: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,418 INFO L290 TraceCheckUtils]: 158: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,419 INFO L290 TraceCheckUtils]: 159: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,419 INFO L290 TraceCheckUtils]: 160: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,419 INFO L290 TraceCheckUtils]: 161: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,420 INFO L290 TraceCheckUtils]: 162: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:39:15,420 INFO L290 TraceCheckUtils]: 163: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102781#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-28 08:39:15,420 INFO L290 TraceCheckUtils]: 164: Hoare triple {102781#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {102776#false} is VALID [2022-04-28 08:39:15,420 INFO L290 TraceCheckUtils]: 165: Hoare triple {102776#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {102776#false} is VALID [2022-04-28 08:39:15,420 INFO L290 TraceCheckUtils]: 166: Hoare triple {102776#false} assume 5 == ~blastFlag~0; {102776#false} is VALID [2022-04-28 08:39:15,420 INFO L290 TraceCheckUtils]: 167: Hoare triple {102776#false} assume !false; {102776#false} is VALID [2022-04-28 08:39:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:39:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:15,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038907221] [2022-04-28 08:39:15,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038907221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:15,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:15,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:15,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:15,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002678642] [2022-04-28 08:39:15,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002678642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:15,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:15,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304902129] [2022-04-28 08:39:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 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 168 [2022-04-28 08:39:15,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:15,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:15,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:15,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:15,484 INFO L87 Difference]: Start difference. First operand 952 states and 1391 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:17,506 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-28 08:39:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:18,683 INFO L93 Difference]: Finished difference Result 2219 states and 3222 transitions. [2022-04-28 08:39:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 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 168 [2022-04-28 08:39:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:39:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:39:18,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 08:39:18,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:19,039 INFO L225 Difference]: With dead ends: 2219 [2022-04-28 08:39:19,039 INFO L226 Difference]: Without dead ends: 1283 [2022-04-28 08:39:19,040 INFO L412 NwaCegarLoop]: 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-28 08:39:19,041 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:19,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:39:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-04-28 08:39:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 957. [2022-04-28 08:39:19,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:19,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1283 states. Second operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:19,098 INFO L74 IsIncluded]: Start isIncluded. First operand 1283 states. Second operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:19,098 INFO L87 Difference]: Start difference. First operand 1283 states. Second operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:19,144 INFO L93 Difference]: Finished difference Result 1283 states and 1846 transitions. [2022-04-28 08:39:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1846 transitions. [2022-04-28 08:39:19,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:19,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:19,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 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 1283 states. [2022-04-28 08:39:19,147 INFO L87 Difference]: Start difference. First operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 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 1283 states. [2022-04-28 08:39:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:19,193 INFO L93 Difference]: Finished difference Result 1283 states and 1846 transitions. [2022-04-28 08:39:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1846 transitions. [2022-04-28 08:39:19,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:19,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:19,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:19,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1396 transitions. [2022-04-28 08:39:19,235 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1396 transitions. Word has length 168 [2022-04-28 08:39:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:19,235 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1396 transitions. [2022-04-28 08:39:19,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:19,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1396 transitions. [2022-04-28 08:39:20,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1396 edges. 1396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1396 transitions. [2022-04-28 08:39:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-28 08:39:20,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:20,453 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:20,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:39:20,453 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 908405628, now seen corresponding path program 1 times [2022-04-28 08:39:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:20,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045964115] [2022-04-28 08:39:31,207 WARN L232 SmtUtils]: Spent 10.42s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:40,375 WARN L232 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:39:46,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash 908405628, now seen corresponding path program 2 times [2022-04-28 08:39:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:46,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259719329] [2022-04-28 08:39:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:47,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {111712#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {111705#true} is VALID [2022-04-28 08:39:47,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {111705#true} assume true; {111705#true} is VALID [2022-04-28 08:39:47,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111705#true} {111705#true} #592#return; {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {111705#true} call ULTIMATE.init(); {111712#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:39:47,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {111712#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {111705#true} assume true; {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111705#true} {111705#true} #592#return; {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {111705#true} call #t~ret159 := main(); {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {111705#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {111705#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {111705#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {111705#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {111705#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {111705#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#true} assume 12292 == #t~mem43;havoc #t~mem43; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {111705#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {111705#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {111705#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {111705#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {111705#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {111705#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {111705#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {111705#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {111705#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {111705#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {111705#true} assume 4368 == #t~mem48;havoc #t~mem48; {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {111705#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {111705#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {111705#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {111705#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {111705#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {111705#true} assume 4384 == #t~mem50;havoc #t~mem50; {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {111705#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {111705#true} is VALID [2022-04-28 08:39:47,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {111705#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {111705#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 54: Hoare triple {111705#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {111705#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {111705#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 63: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,045 INFO L290 TraceCheckUtils]: 67: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 70: Hoare triple {111705#true} assume 4400 == #t~mem52;havoc #t~mem52; {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 71: Hoare triple {111705#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 72: Hoare triple {111705#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {111705#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 74: Hoare triple {111705#true} assume !(~ret~0 <= 0); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 75: Hoare triple {111705#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 76: Hoare triple {111705#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 81: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 83: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 90: Hoare triple {111705#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 91: Hoare triple {111705#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 92: Hoare triple {111705#true} assume 4416 == #t~mem54;havoc #t~mem54; {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 93: Hoare triple {111705#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 94: Hoare triple {111705#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 95: Hoare triple {111705#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 96: Hoare triple {111705#true} assume !(0 == ~tmp___6~0); {111705#true} is VALID [2022-04-28 08:39:47,047 INFO L290 TraceCheckUtils]: 97: Hoare triple {111705#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 98: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 99: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 100: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 101: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 102: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 103: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 104: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 105: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 106: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 107: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 108: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 109: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 110: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 111: Hoare triple {111705#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,048 INFO L290 TraceCheckUtils]: 112: Hoare triple {111705#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 113: Hoare triple {111705#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 114: Hoare triple {111705#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 115: Hoare triple {111705#true} assume 4432 == #t~mem56;havoc #t~mem56; {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 116: Hoare triple {111705#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 117: Hoare triple {111705#true} assume !(5 == ~blastFlag~0); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 118: Hoare triple {111705#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 119: Hoare triple {111705#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 120: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 121: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 122: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 123: Hoare triple {111705#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 124: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 125: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 126: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,049 INFO L290 TraceCheckUtils]: 127: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 128: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 129: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 130: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 131: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 132: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 133: Hoare triple {111705#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 134: Hoare triple {111705#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 135: Hoare triple {111705#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 136: Hoare triple {111705#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {111705#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 138: Hoare triple {111705#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 139: Hoare triple {111705#true} assume 4448 == #t~mem58;havoc #t~mem58; {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 140: Hoare triple {111705#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 141: Hoare triple {111705#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {111705#true} is VALID [2022-04-28 08:39:47,050 INFO L290 TraceCheckUtils]: 142: Hoare triple {111705#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {111705#true} is VALID [2022-04-28 08:39:47,051 INFO L290 TraceCheckUtils]: 143: Hoare triple {111705#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,052 INFO L290 TraceCheckUtils]: 144: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,052 INFO L290 TraceCheckUtils]: 145: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,053 INFO L290 TraceCheckUtils]: 146: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,053 INFO L290 TraceCheckUtils]: 147: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,053 INFO L290 TraceCheckUtils]: 148: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,053 INFO L290 TraceCheckUtils]: 149: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,054 INFO L290 TraceCheckUtils]: 150: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,054 INFO L290 TraceCheckUtils]: 151: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,054 INFO L290 TraceCheckUtils]: 152: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,055 INFO L290 TraceCheckUtils]: 153: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,055 INFO L290 TraceCheckUtils]: 154: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,055 INFO L290 TraceCheckUtils]: 155: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,055 INFO L290 TraceCheckUtils]: 156: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,056 INFO L290 TraceCheckUtils]: 157: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,056 INFO L290 TraceCheckUtils]: 158: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,056 INFO L290 TraceCheckUtils]: 159: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 160: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111711#(= |ssl3_connect_#t~mem54| 4464)} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 161: Hoare triple {111711#(= |ssl3_connect_#t~mem54| 4464)} assume 4416 == #t~mem54;havoc #t~mem54; {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 162: Hoare triple {111706#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 163: Hoare triple {111706#false} assume !(3 == ~blastFlag~0); {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 164: Hoare triple {111706#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 165: Hoare triple {111706#false} assume !(0 == ~tmp___6~0); {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 166: Hoare triple {111706#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 167: Hoare triple {111706#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111706#false} is VALID [2022-04-28 08:39:47,057 INFO L290 TraceCheckUtils]: 168: Hoare triple {111706#false} ~skip~0 := 0; {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 169: Hoare triple {111706#false} assume !false; {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 170: Hoare triple {111706#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 171: Hoare triple {111706#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 172: Hoare triple {111706#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 173: Hoare triple {111706#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 174: Hoare triple {111706#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 175: Hoare triple {111706#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 176: Hoare triple {111706#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 177: Hoare triple {111706#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 178: Hoare triple {111706#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 179: Hoare triple {111706#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 180: Hoare triple {111706#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 181: Hoare triple {111706#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 182: Hoare triple {111706#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,058 INFO L290 TraceCheckUtils]: 183: Hoare triple {111706#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-28 08:39:47,059 INFO L290 TraceCheckUtils]: 184: Hoare triple {111706#false} assume 4432 == #t~mem56;havoc #t~mem56; {111706#false} is VALID [2022-04-28 08:39:47,059 INFO L290 TraceCheckUtils]: 185: Hoare triple {111706#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {111706#false} is VALID [2022-04-28 08:39:47,059 INFO L290 TraceCheckUtils]: 186: Hoare triple {111706#false} assume 5 == ~blastFlag~0; {111706#false} is VALID [2022-04-28 08:39:47,059 INFO L290 TraceCheckUtils]: 187: Hoare triple {111706#false} assume !false; {111706#false} is VALID [2022-04-28 08:39:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:39:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259719329] [2022-04-28 08:39:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259719329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:47,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:47,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:47,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:47,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045964115] [2022-04-28 08:39:47,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045964115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:47,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:47,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444341520] [2022-04-28 08:39:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:47,060 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 188 [2022-04-28 08:39:47,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:47,061 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-28 08:39:47,133 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-28 08:39:47,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:47,134 INFO L87 Difference]: Start difference. First operand 957 states and 1396 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-28 08:39:49,154 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-28 08:39:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:50,662 INFO L93 Difference]: Finished difference Result 2253 states and 3280 transitions. [2022-04-28 08:39:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:50,662 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 188 [2022-04-28 08:39:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:50,662 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-28 08:39:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-28 08:39:50,664 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-28 08:39:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-28 08:39:50,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-28 08:39:50,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:51,014 INFO L225 Difference]: With dead ends: 2253 [2022-04-28 08:39:51,014 INFO L226 Difference]: Without dead ends: 1312 [2022-04-28 08:39:51,015 INFO L412 NwaCegarLoop]: 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-28 08:39:51,015 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 89 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:51,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 566 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 536 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:39:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-04-28 08:39:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1049. [2022-04-28 08:39:51,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:51,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1312 states. Second operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:51,069 INFO L74 IsIncluded]: Start isIncluded. First operand 1312 states. Second operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:51,069 INFO L87 Difference]: Start difference. First operand 1312 states. Second operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:51,116 INFO L93 Difference]: Finished difference Result 1312 states and 1900 transitions. [2022-04-28 08:39:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1900 transitions. [2022-04-28 08:39:51,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:51,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:51,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 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 1312 states. [2022-04-28 08:39:51,119 INFO L87 Difference]: Start difference. First operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 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 1312 states. [2022-04-28 08:39:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:51,166 INFO L93 Difference]: Finished difference Result 1312 states and 1900 transitions. [2022-04-28 08:39:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1900 transitions. [2022-04-28 08:39:51,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:51,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:51,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:51,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1532 transitions. [2022-04-28 08:39:51,227 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1532 transitions. Word has length 188 [2022-04-28 08:39:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:51,228 INFO L495 AbstractCegarLoop]: Abstraction has 1049 states and 1532 transitions. [2022-04-28 08:39:51,228 INFO L496 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-28 08:39:51,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1049 states and 1532 transitions. [2022-04-28 08:39:52,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1532 edges. 1532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1532 transitions. [2022-04-28 08:39:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-28 08:39:52,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:52,587 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:52,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:39:52,587 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1801891966, now seen corresponding path program 1 times [2022-04-28 08:39:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:52,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103410126] [2022-04-28 08:40:06,070 WARN L232 SmtUtils]: Spent 13.12s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:40:20,343 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1801891966, now seen corresponding path program 2 times [2022-04-28 08:40:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:20,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838243641] [2022-04-28 08:40:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:20,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {120952#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {120945#true} is VALID [2022-04-28 08:40:20,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {120945#true} assume true; {120945#true} is VALID [2022-04-28 08:40:20,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120945#true} {120945#true} #592#return; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {120945#true} call ULTIMATE.init(); {120952#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:40:20,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {120952#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {120945#true} assume true; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120945#true} {120945#true} #592#return; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {120945#true} call #t~ret159 := main(); {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {120945#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {120945#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {120945#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {120945#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {120945#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {120945#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {120945#true} assume 12292 == #t~mem43;havoc #t~mem43; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {120945#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {120945#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {120945#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {120945#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {120945#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {120945#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {120945#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {120945#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {120945#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {120945#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {120945#true} assume 4368 == #t~mem48;havoc #t~mem48; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {120945#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {120945#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {120945#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {120945#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {120945#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {120945#true} assume 4384 == #t~mem50;havoc #t~mem50; {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {120945#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {120945#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {120945#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {120945#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {120945#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {120945#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {120945#true} assume 4400 == #t~mem52;havoc #t~mem52; {120945#true} is VALID [2022-04-28 08:40:20,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {120945#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {120945#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {120945#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {120945#true} assume !(~ret~0 <= 0); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {120945#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {120945#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {120945#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {120945#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {120945#true} assume 4416 == #t~mem54;havoc #t~mem54; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {120945#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {120945#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 95: Hoare triple {120945#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {120945#true} assume !(0 == ~tmp___6~0); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 97: Hoare triple {120945#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 98: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 99: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 100: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,526 INFO L290 TraceCheckUtils]: 101: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 103: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 104: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 105: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 111: Hoare triple {120945#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 112: Hoare triple {120945#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 113: Hoare triple {120945#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 114: Hoare triple {120945#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 115: Hoare triple {120945#true} assume 4432 == #t~mem56;havoc #t~mem56; {120945#true} is VALID [2022-04-28 08:40:20,527 INFO L290 TraceCheckUtils]: 116: Hoare triple {120945#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 117: Hoare triple {120945#true} assume !(5 == ~blastFlag~0); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 118: Hoare triple {120945#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {120945#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 122: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {120945#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 124: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 125: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 126: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 127: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 128: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 129: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 130: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,528 INFO L290 TraceCheckUtils]: 131: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 132: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 133: Hoare triple {120945#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 134: Hoare triple {120945#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 135: Hoare triple {120945#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 136: Hoare triple {120945#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 137: Hoare triple {120945#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 138: Hoare triple {120945#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 139: Hoare triple {120945#true} assume 4448 == #t~mem58;havoc #t~mem58; {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 140: Hoare triple {120945#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 141: Hoare triple {120945#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {120945#true} is VALID [2022-04-28 08:40:20,529 INFO L290 TraceCheckUtils]: 142: Hoare triple {120945#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {120945#true} is VALID [2022-04-28 08:40:20,530 INFO L290 TraceCheckUtils]: 143: Hoare triple {120945#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,531 INFO L290 TraceCheckUtils]: 144: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,531 INFO L290 TraceCheckUtils]: 145: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,531 INFO L290 TraceCheckUtils]: 146: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,532 INFO L290 TraceCheckUtils]: 147: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,532 INFO L290 TraceCheckUtils]: 148: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,532 INFO L290 TraceCheckUtils]: 149: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,533 INFO L290 TraceCheckUtils]: 150: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,533 INFO L290 TraceCheckUtils]: 151: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,533 INFO L290 TraceCheckUtils]: 152: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,534 INFO L290 TraceCheckUtils]: 153: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,534 INFO L290 TraceCheckUtils]: 154: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,534 INFO L290 TraceCheckUtils]: 155: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,535 INFO L290 TraceCheckUtils]: 156: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,535 INFO L290 TraceCheckUtils]: 157: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,535 INFO L290 TraceCheckUtils]: 158: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 159: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 160: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120951#(not (= |ssl3_connect_#t~mem54| 4416))} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 161: Hoare triple {120951#(not (= |ssl3_connect_#t~mem54| 4416))} assume 4416 == #t~mem54;havoc #t~mem54; {120946#false} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 162: Hoare triple {120946#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {120946#false} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 163: Hoare triple {120946#false} assume !(3 == ~blastFlag~0); {120946#false} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 164: Hoare triple {120946#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {120946#false} is VALID [2022-04-28 08:40:20,536 INFO L290 TraceCheckUtils]: 165: Hoare triple {120946#false} assume !(0 == ~tmp___6~0); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 166: Hoare triple {120946#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 167: Hoare triple {120946#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 168: Hoare triple {120946#false} ~skip~0 := 0; {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 169: Hoare triple {120946#false} assume !false; {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 170: Hoare triple {120946#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 171: Hoare triple {120946#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 172: Hoare triple {120946#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 173: Hoare triple {120946#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 174: Hoare triple {120946#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 175: Hoare triple {120946#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 176: Hoare triple {120946#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 177: Hoare triple {120946#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 178: Hoare triple {120946#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 179: Hoare triple {120946#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,537 INFO L290 TraceCheckUtils]: 180: Hoare triple {120946#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 181: Hoare triple {120946#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 182: Hoare triple {120946#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 183: Hoare triple {120946#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 184: Hoare triple {120946#false} assume 4432 == #t~mem56;havoc #t~mem56; {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 185: Hoare triple {120946#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 186: Hoare triple {120946#false} assume 5 == ~blastFlag~0; {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L290 TraceCheckUtils]: 187: Hoare triple {120946#false} assume !false; {120946#false} is VALID [2022-04-28 08:40:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:40:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838243641] [2022-04-28 08:40:20,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838243641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:20,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:20,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:20,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103410126] [2022-04-28 08:40:20,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103410126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:20,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:20,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640535325] [2022-04-28 08:40:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:20,540 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 188 [2022-04-28 08:40:20,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:20,540 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-28 08:40:20,620 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-28 08:40:20,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:20,621 INFO L87 Difference]: Start difference. First operand 1049 states and 1532 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-28 08:40:22,643 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-28 08:40:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:23,918 INFO L93 Difference]: Finished difference Result 2533 states and 3684 transitions. [2022-04-28 08:40:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:23,918 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 188 [2022-04-28 08:40:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:23,918 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-28 08:40:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 08:40:23,920 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-28 08:40:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 08:40:23,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-28 08:40:24,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:24,314 INFO L225 Difference]: With dead ends: 2533 [2022-04-28 08:40:24,315 INFO L226 Difference]: Without dead ends: 1500 [2022-04-28 08:40:24,316 INFO L412 NwaCegarLoop]: 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-28 08:40:24,316 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:24,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 286 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:40:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2022-04-28 08:40:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1067. [2022-04-28 08:40:24,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:24,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1500 states. Second operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:24,377 INFO L74 IsIncluded]: Start isIncluded. First operand 1500 states. Second operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:24,378 INFO L87 Difference]: Start difference. First operand 1500 states. Second operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:24,438 INFO L93 Difference]: Finished difference Result 1500 states and 2163 transitions. [2022-04-28 08:40:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2163 transitions. [2022-04-28 08:40:24,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:24,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:24,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 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 1500 states. [2022-04-28 08:40:24,442 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 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 1500 states. [2022-04-28 08:40:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:24,504 INFO L93 Difference]: Finished difference Result 1500 states and 2163 transitions. [2022-04-28 08:40:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2163 transitions. [2022-04-28 08:40:24,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:24,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:24,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:24,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1557 transitions. [2022-04-28 08:40:24,568 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1557 transitions. Word has length 188 [2022-04-28 08:40:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:24,568 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1557 transitions. [2022-04-28 08:40:24,568 INFO L496 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-28 08:40:24,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1557 transitions. [2022-04-28 08:40:26,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1557 edges. 1557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1557 transitions. [2022-04-28 08:40:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 08:40:26,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:26,038 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:26,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:40:26,038 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1954262571, now seen corresponding path program 1 times [2022-04-28 08:40:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:26,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663855812] [2022-04-28 08:40:37,918 WARN L232 SmtUtils]: Spent 11.48s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:40:46,374 WARN L232 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:40:53,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:53,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1954262571, now seen corresponding path program 2 times [2022-04-28 08:40:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:53,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399159447] [2022-04-28 08:40:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:53,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {131164#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {131157#true} is VALID [2022-04-28 08:40:53,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {131157#true} assume true; {131157#true} is VALID [2022-04-28 08:40:53,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131157#true} {131157#true} #592#return; {131157#true} is VALID [2022-04-28 08:40:53,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {131157#true} call ULTIMATE.init(); {131164#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:40:53,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {131164#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {131157#true} is VALID [2022-04-28 08:40:53,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {131157#true} assume true; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131157#true} {131157#true} #592#return; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {131157#true} call #t~ret159 := main(); {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {131157#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {131157#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {131157#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {131157#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {131157#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {131157#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {131157#true} assume 12292 == #t~mem43;havoc #t~mem43; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {131157#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {131157#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {131157#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {131157#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {131157#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {131157#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {131157#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {131157#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {131157#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {131157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {131157#true} assume 4368 == #t~mem48;havoc #t~mem48; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {131157#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {131157#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {131157#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {131157#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {131157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {131157#true} assume 4384 == #t~mem50;havoc #t~mem50; {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {131157#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {131157#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {131157#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 54: Hoare triple {131157#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 55: Hoare triple {131157#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {131157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 63: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 64: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 66: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 69: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 70: Hoare triple {131157#true} assume 4400 == #t~mem52;havoc #t~mem52; {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 71: Hoare triple {131157#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 72: Hoare triple {131157#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 73: Hoare triple {131157#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {131157#true} assume !(~ret~0 <= 0); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {131157#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {131157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 78: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 81: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 82: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 88: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 89: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {131157#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {131157#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 92: Hoare triple {131157#true} assume 4416 == #t~mem54;havoc #t~mem54; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 93: Hoare triple {131157#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 94: Hoare triple {131157#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 95: Hoare triple {131157#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {131157#true} assume !(0 == ~tmp___6~0); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {131157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 98: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 99: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 100: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 101: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 102: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 107: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 108: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 109: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 110: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 111: Hoare triple {131157#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 112: Hoare triple {131157#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 113: Hoare triple {131157#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 114: Hoare triple {131157#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 115: Hoare triple {131157#true} assume 4432 == #t~mem56;havoc #t~mem56; {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 116: Hoare triple {131157#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 117: Hoare triple {131157#true} assume !(5 == ~blastFlag~0); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 118: Hoare triple {131157#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 119: Hoare triple {131157#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,231 INFO L290 TraceCheckUtils]: 120: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 121: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 122: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 123: Hoare triple {131157#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 124: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 125: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 126: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 127: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 128: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 129: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 130: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 131: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 132: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 133: Hoare triple {131157#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 134: Hoare triple {131157#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 135: Hoare triple {131157#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,232 INFO L290 TraceCheckUtils]: 136: Hoare triple {131157#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,233 INFO L290 TraceCheckUtils]: 137: Hoare triple {131157#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,233 INFO L290 TraceCheckUtils]: 138: Hoare triple {131157#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,233 INFO L290 TraceCheckUtils]: 139: Hoare triple {131157#true} assume 4448 == #t~mem58;havoc #t~mem58; {131157#true} is VALID [2022-04-28 08:40:53,233 INFO L290 TraceCheckUtils]: 140: Hoare triple {131157#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {131157#true} is VALID [2022-04-28 08:40:53,233 INFO L290 TraceCheckUtils]: 141: Hoare triple {131157#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {131157#true} is VALID [2022-04-28 08:40:53,233 INFO L290 TraceCheckUtils]: 142: Hoare triple {131157#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {131157#true} is VALID [2022-04-28 08:40:53,234 INFO L290 TraceCheckUtils]: 143: Hoare triple {131157#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,234 INFO L290 TraceCheckUtils]: 144: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,235 INFO L290 TraceCheckUtils]: 145: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,235 INFO L290 TraceCheckUtils]: 146: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,235 INFO L290 TraceCheckUtils]: 147: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,236 INFO L290 TraceCheckUtils]: 148: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,236 INFO L290 TraceCheckUtils]: 149: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,236 INFO L290 TraceCheckUtils]: 150: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,237 INFO L290 TraceCheckUtils]: 151: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,237 INFO L290 TraceCheckUtils]: 152: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,237 INFO L290 TraceCheckUtils]: 153: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,238 INFO L290 TraceCheckUtils]: 154: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,238 INFO L290 TraceCheckUtils]: 155: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,238 INFO L290 TraceCheckUtils]: 156: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,238 INFO L290 TraceCheckUtils]: 157: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,239 INFO L290 TraceCheckUtils]: 158: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,239 INFO L290 TraceCheckUtils]: 159: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,239 INFO L290 TraceCheckUtils]: 160: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 161: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131163#(= |ssl3_connect_#t~mem55| 4464)} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 162: Hoare triple {131163#(= |ssl3_connect_#t~mem55| 4464)} assume 4417 == #t~mem55;havoc #t~mem55; {131158#false} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 163: Hoare triple {131158#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {131158#false} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 164: Hoare triple {131158#false} assume !(3 == ~blastFlag~0); {131158#false} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 165: Hoare triple {131158#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {131158#false} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 166: Hoare triple {131158#false} assume !(0 == ~tmp___6~0); {131158#false} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 167: Hoare triple {131158#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,240 INFO L290 TraceCheckUtils]: 168: Hoare triple {131158#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 169: Hoare triple {131158#false} ~skip~0 := 0; {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 170: Hoare triple {131158#false} assume !false; {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 171: Hoare triple {131158#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 172: Hoare triple {131158#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 173: Hoare triple {131158#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 174: Hoare triple {131158#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 175: Hoare triple {131158#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 176: Hoare triple {131158#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 177: Hoare triple {131158#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 178: Hoare triple {131158#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 179: Hoare triple {131158#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 180: Hoare triple {131158#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 181: Hoare triple {131158#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 182: Hoare triple {131158#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,241 INFO L290 TraceCheckUtils]: 183: Hoare triple {131158#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,242 INFO L290 TraceCheckUtils]: 184: Hoare triple {131158#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-28 08:40:53,242 INFO L290 TraceCheckUtils]: 185: Hoare triple {131158#false} assume 4432 == #t~mem56;havoc #t~mem56; {131158#false} is VALID [2022-04-28 08:40:53,242 INFO L290 TraceCheckUtils]: 186: Hoare triple {131158#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {131158#false} is VALID [2022-04-28 08:40:53,242 INFO L290 TraceCheckUtils]: 187: Hoare triple {131158#false} assume 5 == ~blastFlag~0; {131158#false} is VALID [2022-04-28 08:40:53,242 INFO L290 TraceCheckUtils]: 188: Hoare triple {131158#false} assume !false; {131158#false} is VALID [2022-04-28 08:40:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:40:53,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:53,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399159447] [2022-04-28 08:40:53,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399159447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:53,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:53,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:53,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:53,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663855812] [2022-04-28 08:40:53,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663855812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:53,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:53,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018923214] [2022-04-28 08:40:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2022-04-28 08:40:53,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:53,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:53,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:53,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:53,324 INFO L87 Difference]: Start difference. First operand 1067 states and 1557 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:55,345 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-28 08:40:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:56,938 INFO L93 Difference]: Finished difference Result 2461 states and 3585 transitions. [2022-04-28 08:40:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2022-04-28 08:40:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 08:40:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 08:40:56,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-28 08:40:57,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:57,296 INFO L225 Difference]: With dead ends: 2461 [2022-04-28 08:40:57,297 INFO L226 Difference]: Without dead ends: 1410 [2022-04-28 08:40:57,298 INFO L412 NwaCegarLoop]: 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-28 08:40:57,298 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 84 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:57,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 558 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:40:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-04-28 08:40:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1163. [2022-04-28 08:40:57,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:57,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1410 states. Second operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,375 INFO L74 IsIncluded]: Start isIncluded. First operand 1410 states. Second operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,376 INFO L87 Difference]: Start difference. First operand 1410 states. Second operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:57,428 INFO L93 Difference]: Finished difference Result 1410 states and 2044 transitions. [2022-04-28 08:40:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2044 transitions. [2022-04-28 08:40:57,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:57,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:57,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 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 1410 states. [2022-04-28 08:40:57,432 INFO L87 Difference]: Start difference. First operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 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 1410 states. [2022-04-28 08:40:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:57,488 INFO L93 Difference]: Finished difference Result 1410 states and 2044 transitions. [2022-04-28 08:40:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2044 transitions. [2022-04-28 08:40:57,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:57,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:57,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:57,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1697 transitions. [2022-04-28 08:40:57,548 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1697 transitions. Word has length 189 [2022-04-28 08:40:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:57,548 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1697 transitions. [2022-04-28 08:40:57,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1163 states and 1697 transitions. [2022-04-28 08:40:59,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1697 edges. 1697 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1697 transitions. [2022-04-28 08:40:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 08:40:59,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:59,187 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:59,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:40:59,187 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -412432023, now seen corresponding path program 1 times [2022-04-28 08:40:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:59,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814206191] [2022-04-28 08:41:09,589 WARN L232 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:41:19,427 WARN L232 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:41:25,820 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash -412432023, now seen corresponding path program 2 times [2022-04-28 08:41:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:25,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823145309] [2022-04-28 08:41:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:26,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {141244#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141237#true} is VALID [2022-04-28 08:41:26,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {141237#true} assume true; {141237#true} is VALID [2022-04-28 08:41:26,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141237#true} {141237#true} #592#return; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {141237#true} call ULTIMATE.init(); {141244#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:41:26,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {141244#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {141237#true} assume true; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141237#true} {141237#true} #592#return; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {141237#true} call #t~ret159 := main(); {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {141237#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {141237#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {141237#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {141237#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {141237#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {141237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {141237#true} assume 12292 == #t~mem43;havoc #t~mem43; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {141237#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {141237#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {141237#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {141237#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {141237#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {141237#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {141237#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {141237#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {141237#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {141237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {141237#true} assume 4368 == #t~mem48;havoc #t~mem48; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {141237#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {141237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {141237#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {141237#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {141237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {141237#true} assume 4384 == #t~mem50;havoc #t~mem50; {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {141237#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {141237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {141237#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {141237#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {141237#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 56: Hoare triple {141237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 61: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 63: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {141237#true} assume 4400 == #t~mem52;havoc #t~mem52; {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {141237#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {141237#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 73: Hoare triple {141237#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 74: Hoare triple {141237#true} assume !(~ret~0 <= 0); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 75: Hoare triple {141237#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 76: Hoare triple {141237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 79: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 80: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 81: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 83: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 86: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,023 INFO L290 TraceCheckUtils]: 87: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 88: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 89: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 90: Hoare triple {141237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 91: Hoare triple {141237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 92: Hoare triple {141237#true} assume 4416 == #t~mem54;havoc #t~mem54; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 93: Hoare triple {141237#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 94: Hoare triple {141237#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 95: Hoare triple {141237#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 96: Hoare triple {141237#true} assume !(0 == ~tmp___6~0); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 97: Hoare triple {141237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 98: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 99: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 100: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,024 INFO L290 TraceCheckUtils]: 101: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 102: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 103: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 104: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 105: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 106: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 107: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 108: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 109: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 110: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 111: Hoare triple {141237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 112: Hoare triple {141237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 113: Hoare triple {141237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 114: Hoare triple {141237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,025 INFO L290 TraceCheckUtils]: 115: Hoare triple {141237#true} assume 4432 == #t~mem56;havoc #t~mem56; {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 116: Hoare triple {141237#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 117: Hoare triple {141237#true} assume !(5 == ~blastFlag~0); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 118: Hoare triple {141237#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 119: Hoare triple {141237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 120: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 121: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 122: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 123: Hoare triple {141237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 124: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 125: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 126: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 127: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 128: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,026 INFO L290 TraceCheckUtils]: 129: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 130: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 131: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 132: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 133: Hoare triple {141237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 134: Hoare triple {141237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 135: Hoare triple {141237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 136: Hoare triple {141237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 137: Hoare triple {141237#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 138: Hoare triple {141237#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 139: Hoare triple {141237#true} assume 4448 == #t~mem58;havoc #t~mem58; {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 140: Hoare triple {141237#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 141: Hoare triple {141237#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {141237#true} is VALID [2022-04-28 08:41:26,027 INFO L290 TraceCheckUtils]: 142: Hoare triple {141237#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {141237#true} is VALID [2022-04-28 08:41:26,028 INFO L290 TraceCheckUtils]: 143: Hoare triple {141237#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,029 INFO L290 TraceCheckUtils]: 144: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,029 INFO L290 TraceCheckUtils]: 145: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,029 INFO L290 TraceCheckUtils]: 146: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,030 INFO L290 TraceCheckUtils]: 147: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,030 INFO L290 TraceCheckUtils]: 148: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,030 INFO L290 TraceCheckUtils]: 149: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,031 INFO L290 TraceCheckUtils]: 150: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,031 INFO L290 TraceCheckUtils]: 151: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,031 INFO L290 TraceCheckUtils]: 152: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,032 INFO L290 TraceCheckUtils]: 153: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,032 INFO L290 TraceCheckUtils]: 154: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,032 INFO L290 TraceCheckUtils]: 155: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,033 INFO L290 TraceCheckUtils]: 156: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,033 INFO L290 TraceCheckUtils]: 157: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,033 INFO L290 TraceCheckUtils]: 158: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,034 INFO L290 TraceCheckUtils]: 159: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,034 INFO L290 TraceCheckUtils]: 160: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:26,034 INFO L290 TraceCheckUtils]: 161: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141243#(not (= |ssl3_connect_#t~mem55| 4417))} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 162: Hoare triple {141243#(not (= |ssl3_connect_#t~mem55| 4417))} assume 4417 == #t~mem55;havoc #t~mem55; {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 163: Hoare triple {141238#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 164: Hoare triple {141238#false} assume !(3 == ~blastFlag~0); {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 165: Hoare triple {141238#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 166: Hoare triple {141238#false} assume !(0 == ~tmp___6~0); {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 167: Hoare triple {141238#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 168: Hoare triple {141238#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 169: Hoare triple {141238#false} ~skip~0 := 0; {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 170: Hoare triple {141238#false} assume !false; {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 171: Hoare triple {141238#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 172: Hoare triple {141238#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 173: Hoare triple {141238#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,035 INFO L290 TraceCheckUtils]: 174: Hoare triple {141238#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 175: Hoare triple {141238#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 176: Hoare triple {141238#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 177: Hoare triple {141238#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 178: Hoare triple {141238#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 179: Hoare triple {141238#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 180: Hoare triple {141238#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 181: Hoare triple {141238#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 182: Hoare triple {141238#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 183: Hoare triple {141238#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 184: Hoare triple {141238#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 185: Hoare triple {141238#false} assume 4432 == #t~mem56;havoc #t~mem56; {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 186: Hoare triple {141238#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 187: Hoare triple {141238#false} assume 5 == ~blastFlag~0; {141238#false} is VALID [2022-04-28 08:41:26,036 INFO L290 TraceCheckUtils]: 188: Hoare triple {141238#false} assume !false; {141238#false} is VALID [2022-04-28 08:41:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:41:26,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:26,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823145309] [2022-04-28 08:41:26,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823145309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:26,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:26,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:26,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:26,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [814206191] [2022-04-28 08:41:26,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [814206191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:26,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:26,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907565088] [2022-04-28 08:41:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2022-04-28 08:41:26,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:26,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:26,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:26,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:26,120 INFO L87 Difference]: Start difference. First operand 1163 states and 1697 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:28,140 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-28 08:41:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:29,453 INFO L93 Difference]: Finished difference Result 2636 states and 3824 transitions. [2022-04-28 08:41:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:29,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2022-04-28 08:41:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 08:41:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 08:41:29,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-28 08:41:29,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:29,854 INFO L225 Difference]: With dead ends: 2636 [2022-04-28 08:41:29,855 INFO L226 Difference]: Without dead ends: 1489 [2022-04-28 08:41:29,856 INFO L412 NwaCegarLoop]: 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-28 08:41:29,857 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 106 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:29,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-04-28 08:41:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1067. [2022-04-28 08:41:29,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:29,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1489 states. Second operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:29,925 INFO L74 IsIncluded]: Start isIncluded. First operand 1489 states. Second operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:29,925 INFO L87 Difference]: Start difference. First operand 1489 states. Second operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:29,983 INFO L93 Difference]: Finished difference Result 1489 states and 2138 transitions. [2022-04-28 08:41:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2138 transitions. [2022-04-28 08:41:29,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:29,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:29,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 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 1489 states. [2022-04-28 08:41:29,987 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 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 1489 states. [2022-04-28 08:41:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:30,046 INFO L93 Difference]: Finished difference Result 1489 states and 2138 transitions. [2022-04-28 08:41:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2138 transitions. [2022-04-28 08:41:30,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:30,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:30,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:30,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1548 transitions. [2022-04-28 08:41:30,109 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1548 transitions. Word has length 189 [2022-04-28 08:41:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:30,110 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1548 transitions. [2022-04-28 08:41:30,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:30,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1548 transitions. [2022-04-28 08:41:31,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1548 edges. 1548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1548 transitions. [2022-04-28 08:41:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-28 08:41:31,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:31,613 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:31,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:41:31,613 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:31,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 1 times [2022-04-28 08:41:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:31,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857758114] [2022-04-28 08:41:31,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 2 times [2022-04-28 08:41:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:31,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10908157] [2022-04-28 08:41:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:31,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {151640#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {151633#true} is VALID [2022-04-28 08:41:31,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {151633#true} assume true; {151633#true} is VALID [2022-04-28 08:41:31,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151633#true} {151633#true} #592#return; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {151633#true} call ULTIMATE.init(); {151640#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:41:31,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {151640#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {151633#true} assume true; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151633#true} {151633#true} #592#return; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {151633#true} call #t~ret159 := main(); {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {151633#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {151633#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {151633#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {151633#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {151633#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {151633#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {151633#true} assume 12292 == #t~mem43;havoc #t~mem43; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {151633#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {151633#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {151633#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {151633#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {151633#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {151633#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {151633#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {151633#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {151633#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {151633#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {151633#true} assume 4368 == #t~mem48;havoc #t~mem48; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {151633#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {151633#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {151633#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {151633#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {151633#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {151633#true} assume 4384 == #t~mem50;havoc #t~mem50; {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {151633#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {151633#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {151633#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {151633#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {151633#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {151633#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-28 08:41:31,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {151633#true} assume 4400 == #t~mem52;havoc #t~mem52; {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 71: Hoare triple {151633#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,815 INFO L290 TraceCheckUtils]: 72: Hoare triple {151633#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {151633#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {151633#true} assume !(~ret~0 <= 0); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {151633#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {151633#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 83: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 84: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 85: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 86: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,816 INFO L290 TraceCheckUtils]: 87: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 89: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 90: Hoare triple {151633#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 91: Hoare triple {151633#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 92: Hoare triple {151633#true} assume 4416 == #t~mem54;havoc #t~mem54; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 93: Hoare triple {151633#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 94: Hoare triple {151633#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 95: Hoare triple {151633#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 96: Hoare triple {151633#true} assume !(0 == ~tmp___6~0); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {151633#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 98: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 99: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 100: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 101: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,817 INFO L290 TraceCheckUtils]: 102: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 105: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 107: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 108: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 109: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 110: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 111: Hoare triple {151633#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 112: Hoare triple {151633#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 113: Hoare triple {151633#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 114: Hoare triple {151633#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 115: Hoare triple {151633#true} assume 4432 == #t~mem56;havoc #t~mem56; {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 116: Hoare triple {151633#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {151633#true} is VALID [2022-04-28 08:41:31,818 INFO L290 TraceCheckUtils]: 117: Hoare triple {151633#true} assume !(5 == ~blastFlag~0); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 118: Hoare triple {151633#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 119: Hoare triple {151633#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 120: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 121: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 122: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 123: Hoare triple {151633#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 124: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 125: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 126: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 127: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 128: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 129: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 130: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 131: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,819 INFO L290 TraceCheckUtils]: 132: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 133: Hoare triple {151633#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 134: Hoare triple {151633#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 135: Hoare triple {151633#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 136: Hoare triple {151633#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 137: Hoare triple {151633#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 138: Hoare triple {151633#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 139: Hoare triple {151633#true} assume 4448 == #t~mem58;havoc #t~mem58; {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 140: Hoare triple {151633#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 141: Hoare triple {151633#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {151633#true} is VALID [2022-04-28 08:41:31,820 INFO L290 TraceCheckUtils]: 142: Hoare triple {151633#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {151633#true} is VALID [2022-04-28 08:41:31,821 INFO L290 TraceCheckUtils]: 143: Hoare triple {151633#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,822 INFO L290 TraceCheckUtils]: 144: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,822 INFO L290 TraceCheckUtils]: 145: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,822 INFO L290 TraceCheckUtils]: 146: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,822 INFO L290 TraceCheckUtils]: 147: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,823 INFO L290 TraceCheckUtils]: 148: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,823 INFO L290 TraceCheckUtils]: 149: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,823 INFO L290 TraceCheckUtils]: 150: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,823 INFO L290 TraceCheckUtils]: 151: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,824 INFO L290 TraceCheckUtils]: 152: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,824 INFO L290 TraceCheckUtils]: 153: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,824 INFO L290 TraceCheckUtils]: 154: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,824 INFO L290 TraceCheckUtils]: 155: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,825 INFO L290 TraceCheckUtils]: 156: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,825 INFO L290 TraceCheckUtils]: 157: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,825 INFO L290 TraceCheckUtils]: 158: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,825 INFO L290 TraceCheckUtils]: 159: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,825 INFO L290 TraceCheckUtils]: 160: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,826 INFO L290 TraceCheckUtils]: 161: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,826 INFO L290 TraceCheckUtils]: 162: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,826 INFO L290 TraceCheckUtils]: 163: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,826 INFO L290 TraceCheckUtils]: 164: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,827 INFO L290 TraceCheckUtils]: 165: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,827 INFO L290 TraceCheckUtils]: 166: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,827 INFO L290 TraceCheckUtils]: 167: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,828 INFO L290 TraceCheckUtils]: 168: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,828 INFO L290 TraceCheckUtils]: 169: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,828 INFO L290 TraceCheckUtils]: 170: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,828 INFO L290 TraceCheckUtils]: 171: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,829 INFO L290 TraceCheckUtils]: 172: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,829 INFO L290 TraceCheckUtils]: 173: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:31,830 INFO L290 TraceCheckUtils]: 174: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {151639#(not (= |ssl3_connect_#t~mem68| 4512))} is VALID [2022-04-28 08:41:31,830 INFO L290 TraceCheckUtils]: 175: Hoare triple {151639#(not (= |ssl3_connect_#t~mem68| 4512))} assume 4512 == #t~mem68;havoc #t~mem68; {151634#false} is VALID [2022-04-28 08:41:31,834 INFO L290 TraceCheckUtils]: 176: Hoare triple {151634#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {151634#false} is VALID [2022-04-28 08:41:31,834 INFO L290 TraceCheckUtils]: 177: Hoare triple {151634#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 836 + #t~mem112.offset, 4);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 172 + #t~mem111.offset, 4);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 891 + #t~mem114.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,834 INFO L290 TraceCheckUtils]: 178: Hoare triple {151634#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 4294967296;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call write~int(0, #t~mem116.base, 168 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {151634#false} is VALID [2022-04-28 08:41:31,834 INFO L290 TraceCheckUtils]: 179: Hoare triple {151634#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {151634#false} is VALID [2022-04-28 08:41:31,834 INFO L290 TraceCheckUtils]: 180: Hoare triple {151634#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 181: Hoare triple {151634#false} assume !(0 == ~tmp___8~0); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 182: Hoare triple {151634#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 183: Hoare triple {151634#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 184: Hoare triple {151634#false} ~skip~0 := 0; {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 185: Hoare triple {151634#false} assume !false; {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 186: Hoare triple {151634#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 187: Hoare triple {151634#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 188: Hoare triple {151634#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 189: Hoare triple {151634#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 190: Hoare triple {151634#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 191: Hoare triple {151634#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 192: Hoare triple {151634#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 193: Hoare triple {151634#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 194: Hoare triple {151634#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,835 INFO L290 TraceCheckUtils]: 195: Hoare triple {151634#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 196: Hoare triple {151634#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 197: Hoare triple {151634#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 198: Hoare triple {151634#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 199: Hoare triple {151634#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 200: Hoare triple {151634#false} assume 4432 == #t~mem56;havoc #t~mem56; {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 201: Hoare triple {151634#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 202: Hoare triple {151634#false} assume 5 == ~blastFlag~0; {151634#false} is VALID [2022-04-28 08:41:31,836 INFO L290 TraceCheckUtils]: 203: Hoare triple {151634#false} assume !false; {151634#false} is VALID [2022-04-28 08:41:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:41:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:31,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10908157] [2022-04-28 08:41:31,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10908157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:31,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:31,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:31,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:31,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857758114] [2022-04-28 08:41:31,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857758114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:31,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:31,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709477441] [2022-04-28 08:41:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-28 08:41:31,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:31,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:31,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:31,934 INFO L87 Difference]: Start difference. First operand 1067 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:33,958 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-28 08:41:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:35,253 INFO L93 Difference]: Finished difference Result 2579 states and 3716 transitions. [2022-04-28 08:41:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:35,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-28 08:41:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:41:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:41:35,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 08:41:35,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:35,652 INFO L225 Difference]: With dead ends: 2579 [2022-04-28 08:41:35,653 INFO L226 Difference]: Without dead ends: 1528 [2022-04-28 08:41:35,654 INFO L412 NwaCegarLoop]: 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-28 08:41:35,654 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 92 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:35,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2022-04-28 08:41:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1257. [2022-04-28 08:41:35,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:35,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1528 states. Second operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,742 INFO L74 IsIncluded]: Start isIncluded. First operand 1528 states. Second operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,743 INFO L87 Difference]: Start difference. First operand 1528 states. Second operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:35,803 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2022-04-28 08:41:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2183 transitions. [2022-04-28 08:41:35,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:35,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:35,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 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 1528 states. [2022-04-28 08:41:35,807 INFO L87 Difference]: Start difference. First operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 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 1528 states. [2022-04-28 08:41:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:35,868 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2022-04-28 08:41:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2183 transitions. [2022-04-28 08:41:35,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:35,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:35,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:35,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1843 transitions. [2022-04-28 08:41:35,946 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1843 transitions. Word has length 204 [2022-04-28 08:41:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:35,946 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1843 transitions. [2022-04-28 08:41:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:35,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 1843 transitions. [2022-04-28 08:41:37,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1843 edges. 1843 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1843 transitions. [2022-04-28 08:41:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-28 08:41:37,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:37,840 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:37,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 08:41:37,840 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072511, now seen corresponding path program 1 times [2022-04-28 08:41:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:37,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425186626] [2022-04-28 08:41:37,841 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072511, now seen corresponding path program 2 times [2022-04-28 08:41:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:37,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407951369] [2022-04-28 08:41:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:37,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:38,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:38,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {162380#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {162373#true} is VALID [2022-04-28 08:41:38,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {162373#true} assume true; {162373#true} is VALID [2022-04-28 08:41:38,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162373#true} {162373#true} #592#return; {162373#true} is VALID [2022-04-28 08:41:38,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {162373#true} call ULTIMATE.init(); {162380#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:41:38,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {162380#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {162373#true} is VALID [2022-04-28 08:41:38,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {162373#true} assume true; {162373#true} is VALID [2022-04-28 08:41:38,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162373#true} {162373#true} #592#return; {162373#true} is VALID [2022-04-28 08:41:38,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {162373#true} call #t~ret159 := main(); {162373#true} is VALID [2022-04-28 08:41:38,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {162373#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {162373#true} is VALID [2022-04-28 08:41:38,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {162373#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {162373#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {162373#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {162373#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {162373#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {162373#true} assume 12292 == #t~mem43;havoc #t~mem43; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {162373#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {162373#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {162373#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {162373#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {162373#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {162373#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {162373#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {162373#true} is VALID [2022-04-28 08:41:38,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {162373#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {162373#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {162373#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {162373#true} assume 4368 == #t~mem48;havoc #t~mem48; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {162373#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {162373#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {162373#true} is VALID [2022-04-28 08:41:38,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {162373#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {162373#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {162373#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {162373#true} assume 4384 == #t~mem50;havoc #t~mem50; {162373#true} is VALID [2022-04-28 08:41:38,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {162373#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {162373#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {162373#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {162373#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {162373#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {162373#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 67: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 70: Hoare triple {162373#true} assume 4400 == #t~mem52;havoc #t~mem52; {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {162373#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {162373#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {162373#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 74: Hoare triple {162373#true} assume !(~ret~0 <= 0); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 75: Hoare triple {162373#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 76: Hoare triple {162373#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 77: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 78: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 79: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 80: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,030 INFO L290 TraceCheckUtils]: 81: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 82: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 83: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 84: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 85: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 86: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 87: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {162373#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 91: Hoare triple {162373#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 92: Hoare triple {162373#true} assume 4416 == #t~mem54;havoc #t~mem54; {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 93: Hoare triple {162373#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 94: Hoare triple {162373#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 95: Hoare triple {162373#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {162373#true} is VALID [2022-04-28 08:41:38,031 INFO L290 TraceCheckUtils]: 96: Hoare triple {162373#true} assume !(0 == ~tmp___6~0); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 97: Hoare triple {162373#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 98: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 99: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 100: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 101: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 102: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 103: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 104: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 105: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 106: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 107: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 108: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 109: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 110: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,032 INFO L290 TraceCheckUtils]: 111: Hoare triple {162373#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 112: Hoare triple {162373#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 113: Hoare triple {162373#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 114: Hoare triple {162373#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 115: Hoare triple {162373#true} assume 4432 == #t~mem56;havoc #t~mem56; {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 116: Hoare triple {162373#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 117: Hoare triple {162373#true} assume !(5 == ~blastFlag~0); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 118: Hoare triple {162373#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 119: Hoare triple {162373#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 120: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 121: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 122: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 123: Hoare triple {162373#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 124: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 125: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,033 INFO L290 TraceCheckUtils]: 126: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 127: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 128: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 129: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 130: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 131: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 132: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 133: Hoare triple {162373#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 134: Hoare triple {162373#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 135: Hoare triple {162373#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 136: Hoare triple {162373#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 137: Hoare triple {162373#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 138: Hoare triple {162373#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 139: Hoare triple {162373#true} assume 4448 == #t~mem58;havoc #t~mem58; {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 140: Hoare triple {162373#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {162373#true} is VALID [2022-04-28 08:41:38,034 INFO L290 TraceCheckUtils]: 141: Hoare triple {162373#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {162373#true} is VALID [2022-04-28 08:41:38,035 INFO L290 TraceCheckUtils]: 142: Hoare triple {162373#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {162373#true} is VALID [2022-04-28 08:41:38,035 INFO L290 TraceCheckUtils]: 143: Hoare triple {162373#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,036 INFO L290 TraceCheckUtils]: 144: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,036 INFO L290 TraceCheckUtils]: 145: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,037 INFO L290 TraceCheckUtils]: 146: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,037 INFO L290 TraceCheckUtils]: 147: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,037 INFO L290 TraceCheckUtils]: 148: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,037 INFO L290 TraceCheckUtils]: 149: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,038 INFO L290 TraceCheckUtils]: 150: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,038 INFO L290 TraceCheckUtils]: 151: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,038 INFO L290 TraceCheckUtils]: 152: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,039 INFO L290 TraceCheckUtils]: 153: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,039 INFO L290 TraceCheckUtils]: 154: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,039 INFO L290 TraceCheckUtils]: 155: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,040 INFO L290 TraceCheckUtils]: 156: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,040 INFO L290 TraceCheckUtils]: 157: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,040 INFO L290 TraceCheckUtils]: 158: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,040 INFO L290 TraceCheckUtils]: 159: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,041 INFO L290 TraceCheckUtils]: 160: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,041 INFO L290 TraceCheckUtils]: 161: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,041 INFO L290 TraceCheckUtils]: 162: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,042 INFO L290 TraceCheckUtils]: 163: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,042 INFO L290 TraceCheckUtils]: 164: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,042 INFO L290 TraceCheckUtils]: 165: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,043 INFO L290 TraceCheckUtils]: 166: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,043 INFO L290 TraceCheckUtils]: 167: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,043 INFO L290 TraceCheckUtils]: 168: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,043 INFO L290 TraceCheckUtils]: 169: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,044 INFO L290 TraceCheckUtils]: 170: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,044 INFO L290 TraceCheckUtils]: 171: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,044 INFO L290 TraceCheckUtils]: 172: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,045 INFO L290 TraceCheckUtils]: 173: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,045 INFO L290 TraceCheckUtils]: 174: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,045 INFO L290 TraceCheckUtils]: 175: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 176: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {162379#(not (= |ssl3_connect_#t~mem70| 4528))} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 177: Hoare triple {162379#(not (= |ssl3_connect_#t~mem70| 4528))} assume 4528 == #t~mem70;havoc #t~mem70; {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 178: Hoare triple {162374#false} assume -2147483648 <= #t~nondet123 && #t~nondet123 <= 2147483647;~ret~0 := #t~nondet123;havoc #t~nondet123; {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 179: Hoare triple {162374#false} assume !(~ret~0 <= 0);call write~int(4352, ~s.base, 52 + ~s.offset, 4);call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem125 := read~int(#t~mem124.base, #t~mem124.offset, 4);call write~int((if 0 == #t~mem125 then 0 else (if 1 == #t~mem125 then ~bitwiseAnd(#t~mem125, -5) else ~bitwiseAnd(#t~mem125, -5))), #t~mem124.base, #t~mem124.offset, 4);havoc #t~mem124.base, #t~mem124.offset;havoc #t~mem125;call #t~mem126 := read~int(~s.base, 92 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 180: Hoare triple {162374#false} assume !(0 != #t~mem126);havoc #t~mem126;call #t~mem133.base, #t~mem133.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(4560, #t~mem133.base, 844 + #t~mem133.offset, 4);havoc #t~mem133.base, #t~mem133.offset; {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 181: Hoare triple {162374#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 182: Hoare triple {162374#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 183: Hoare triple {162374#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 184: Hoare triple {162374#false} ~skip~0 := 0; {162374#false} is VALID [2022-04-28 08:41:38,046 INFO L290 TraceCheckUtils]: 185: Hoare triple {162374#false} assume !false; {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 186: Hoare triple {162374#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 187: Hoare triple {162374#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 188: Hoare triple {162374#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 189: Hoare triple {162374#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 190: Hoare triple {162374#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 191: Hoare triple {162374#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 192: Hoare triple {162374#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 193: Hoare triple {162374#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 194: Hoare triple {162374#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 195: Hoare triple {162374#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 196: Hoare triple {162374#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 197: Hoare triple {162374#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 198: Hoare triple {162374#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 199: Hoare triple {162374#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-28 08:41:38,047 INFO L290 TraceCheckUtils]: 200: Hoare triple {162374#false} assume 4432 == #t~mem56;havoc #t~mem56; {162374#false} is VALID [2022-04-28 08:41:38,048 INFO L290 TraceCheckUtils]: 201: Hoare triple {162374#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {162374#false} is VALID [2022-04-28 08:41:38,048 INFO L290 TraceCheckUtils]: 202: Hoare triple {162374#false} assume 5 == ~blastFlag~0; {162374#false} is VALID [2022-04-28 08:41:38,048 INFO L290 TraceCheckUtils]: 203: Hoare triple {162374#false} assume !false; {162374#false} is VALID [2022-04-28 08:41:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:41:38,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:38,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407951369] [2022-04-28 08:41:38,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407951369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:38,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:38,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:38,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:38,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425186626] [2022-04-28 08:41:38,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425186626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:38,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:38,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266011945] [2022-04-28 08:41:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-28 08:41:38,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:38,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:38,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:38,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:38,131 INFO L87 Difference]: Start difference. First operand 1257 states and 1843 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:40,151 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-28 08:41:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:41,539 INFO L93 Difference]: Finished difference Result 2824 states and 4116 transitions. [2022-04-28 08:41:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-28 08:41:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:41:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 08:41:41,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 08:41:41,833 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-28 08:41:41,932 INFO L225 Difference]: With dead ends: 2824 [2022-04-28 08:41:41,933 INFO L226 Difference]: Without dead ends: 1583 [2022-04-28 08:41:41,935 INFO L412 NwaCegarLoop]: 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-28 08:41:41,935 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:41,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-28 08:41:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1322. [2022-04-28 08:41:42,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:42,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:42,053 INFO L74 IsIncluded]: Start isIncluded. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:42,054 INFO L87 Difference]: Start difference. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:42,125 INFO L93 Difference]: Finished difference Result 1583 states and 2288 transitions. [2022-04-28 08:41:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2288 transitions. [2022-04-28 08:41:42,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:42,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:42,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1583 states. [2022-04-28 08:41:42,129 INFO L87 Difference]: Start difference. First operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1583 states. [2022-04-28 08:41:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:42,201 INFO L93 Difference]: Finished difference Result 1583 states and 2288 transitions. [2022-04-28 08:41:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2288 transitions. [2022-04-28 08:41:42,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:42,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:42,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:42,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1968 transitions. [2022-04-28 08:41:42,275 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1968 transitions. Word has length 204 [2022-04-28 08:41:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:42,275 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1968 transitions. [2022-04-28 08:41:42,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:42,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1322 states and 1968 transitions. [2022-04-28 08:41:44,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1968 edges. 1968 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1968 transitions. [2022-04-28 08:41:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-28 08:41:44,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:44,352 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:44,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 08:41:44,352 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1665641358, now seen corresponding path program 1 times [2022-04-28 08:41:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:44,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189973323] [2022-04-28 08:41:44,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1665641358, now seen corresponding path program 2 times [2022-04-28 08:41:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:44,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30027518] [2022-04-28 08:41:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:44,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:44,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {173850#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {173843#true} is VALID [2022-04-28 08:41:44,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {173843#true} assume true; {173843#true} is VALID [2022-04-28 08:41:44,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173843#true} {173843#true} #592#return; {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {173843#true} call ULTIMATE.init(); {173850#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:41:44,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {173850#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {173843#true} assume true; {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173843#true} {173843#true} #592#return; {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {173843#true} call #t~ret159 := main(); {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {173843#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {173843#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {173843#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {173843#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {173843#true} is VALID [2022-04-28 08:41:44,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {173843#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {173843#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {173843#true} assume 12292 == #t~mem43;havoc #t~mem43; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {173843#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {173843#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {173843#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {173843#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {173843#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {173843#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {173843#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {173843#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {173843#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {173843#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {173843#true} assume 4368 == #t~mem48;havoc #t~mem48; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {173843#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {173843#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {173843#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {173843#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {173843#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 50: Hoare triple {173843#true} assume 4384 == #t~mem50;havoc #t~mem50; {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 51: Hoare triple {173843#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {173843#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {173843#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {173843#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {173843#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {173843#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 58: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 60: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {173843#true} assume 4400 == #t~mem52;havoc #t~mem52; {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {173843#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {173843#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {173843#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {173843#true} assume !(~ret~0 <= 0); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {173843#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {173843#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 85: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 89: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 90: Hoare triple {173843#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 91: Hoare triple {173843#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 92: Hoare triple {173843#true} assume 4416 == #t~mem54;havoc #t~mem54; {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 93: Hoare triple {173843#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 94: Hoare triple {173843#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 95: Hoare triple {173843#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 96: Hoare triple {173843#true} assume !(0 == ~tmp___6~0); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 97: Hoare triple {173843#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 98: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-28 08:41:44,538 INFO L290 TraceCheckUtils]: 99: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 103: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 104: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 106: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 107: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 109: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 110: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 111: Hoare triple {173843#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 112: Hoare triple {173843#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 113: Hoare triple {173843#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,539 INFO L290 TraceCheckUtils]: 114: Hoare triple {173843#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 115: Hoare triple {173843#true} assume 4432 == #t~mem56;havoc #t~mem56; {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 116: Hoare triple {173843#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 117: Hoare triple {173843#true} assume !(5 == ~blastFlag~0); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 118: Hoare triple {173843#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 119: Hoare triple {173843#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 120: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 121: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 122: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 123: Hoare triple {173843#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 124: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 125: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 126: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 127: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 128: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,540 INFO L290 TraceCheckUtils]: 129: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 130: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 131: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 132: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 133: Hoare triple {173843#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 134: Hoare triple {173843#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 135: Hoare triple {173843#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 136: Hoare triple {173843#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 137: Hoare triple {173843#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 138: Hoare triple {173843#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 139: Hoare triple {173843#true} assume 4448 == #t~mem58;havoc #t~mem58; {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 140: Hoare triple {173843#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 141: Hoare triple {173843#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {173843#true} is VALID [2022-04-28 08:41:44,541 INFO L290 TraceCheckUtils]: 142: Hoare triple {173843#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {173843#true} is VALID [2022-04-28 08:41:44,542 INFO L290 TraceCheckUtils]: 143: Hoare triple {173843#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,543 INFO L290 TraceCheckUtils]: 144: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,543 INFO L290 TraceCheckUtils]: 145: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,543 INFO L290 TraceCheckUtils]: 146: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,544 INFO L290 TraceCheckUtils]: 147: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,544 INFO L290 TraceCheckUtils]: 148: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,544 INFO L290 TraceCheckUtils]: 149: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,544 INFO L290 TraceCheckUtils]: 150: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,545 INFO L290 TraceCheckUtils]: 151: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,545 INFO L290 TraceCheckUtils]: 152: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,545 INFO L290 TraceCheckUtils]: 153: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,545 INFO L290 TraceCheckUtils]: 154: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,546 INFO L290 TraceCheckUtils]: 155: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,546 INFO L290 TraceCheckUtils]: 156: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,546 INFO L290 TraceCheckUtils]: 157: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,546 INFO L290 TraceCheckUtils]: 158: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,547 INFO L290 TraceCheckUtils]: 159: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,547 INFO L290 TraceCheckUtils]: 160: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,547 INFO L290 TraceCheckUtils]: 161: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,547 INFO L290 TraceCheckUtils]: 162: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,548 INFO L290 TraceCheckUtils]: 163: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,548 INFO L290 TraceCheckUtils]: 164: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,548 INFO L290 TraceCheckUtils]: 165: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,548 INFO L290 TraceCheckUtils]: 166: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,549 INFO L290 TraceCheckUtils]: 167: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,549 INFO L290 TraceCheckUtils]: 168: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,549 INFO L290 TraceCheckUtils]: 169: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,549 INFO L290 TraceCheckUtils]: 170: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,550 INFO L290 TraceCheckUtils]: 171: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,550 INFO L290 TraceCheckUtils]: 172: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,550 INFO L290 TraceCheckUtils]: 173: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,550 INFO L290 TraceCheckUtils]: 174: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 175: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {173849#(not (= 4513 |ssl3_connect_#t~mem69|))} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 176: Hoare triple {173849#(not (= 4513 |ssl3_connect_#t~mem69|))} assume 4513 == #t~mem69;havoc #t~mem69; {173844#false} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 177: Hoare triple {173844#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {173844#false} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 178: Hoare triple {173844#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 836 + #t~mem112.offset, 4);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 172 + #t~mem111.offset, 4);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 891 + #t~mem114.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 179: Hoare triple {173844#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 4294967296;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call write~int(0, #t~mem116.base, 168 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {173844#false} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 180: Hoare triple {173844#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {173844#false} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 181: Hoare triple {173844#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {173844#false} is VALID [2022-04-28 08:41:44,551 INFO L290 TraceCheckUtils]: 182: Hoare triple {173844#false} assume !(0 == ~tmp___8~0); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 183: Hoare triple {173844#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 184: Hoare triple {173844#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 185: Hoare triple {173844#false} ~skip~0 := 0; {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 186: Hoare triple {173844#false} assume !false; {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 187: Hoare triple {173844#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 188: Hoare triple {173844#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 189: Hoare triple {173844#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 190: Hoare triple {173844#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 191: Hoare triple {173844#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 192: Hoare triple {173844#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 193: Hoare triple {173844#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 194: Hoare triple {173844#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 195: Hoare triple {173844#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 196: Hoare triple {173844#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,552 INFO L290 TraceCheckUtils]: 197: Hoare triple {173844#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 198: Hoare triple {173844#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 199: Hoare triple {173844#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 200: Hoare triple {173844#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 201: Hoare triple {173844#false} assume 4432 == #t~mem56;havoc #t~mem56; {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 202: Hoare triple {173844#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 203: Hoare triple {173844#false} assume 5 == ~blastFlag~0; {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L290 TraceCheckUtils]: 204: Hoare triple {173844#false} assume !false; {173844#false} is VALID [2022-04-28 08:41:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:41:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30027518] [2022-04-28 08:41:44,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30027518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:44,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:44,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:44,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189973323] [2022-04-28 08:41:44,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189973323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:44,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:44,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:44,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283829952] [2022-04-28 08:41:44,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-28 08:41:44,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:44,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:44,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:44,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:44,647 INFO L87 Difference]: Start difference. First operand 1322 states and 1968 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:46,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:48,050 INFO L93 Difference]: Finished difference Result 2889 states and 4236 transitions. [2022-04-28 08:41:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-28 08:41:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:41:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 08:41:48,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 08:41:48,346 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-28 08:41:48,448 INFO L225 Difference]: With dead ends: 2889 [2022-04-28 08:41:48,448 INFO L226 Difference]: Without dead ends: 1583 [2022-04-28 08:41:48,450 INFO L412 NwaCegarLoop]: 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-28 08:41:48,450 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:48,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-28 08:41:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1322. [2022-04-28 08:41:48,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:48,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,570 INFO L74 IsIncluded]: Start isIncluded. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,570 INFO L87 Difference]: Start difference. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:48,641 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2022-04-28 08:41:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2283 transitions. [2022-04-28 08:41:48,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:48,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:48,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 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 1583 states. [2022-04-28 08:41:48,645 INFO L87 Difference]: Start difference. First operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 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 1583 states. [2022-04-28 08:41:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:48,717 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2022-04-28 08:41:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2283 transitions. [2022-04-28 08:41:48,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:48,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:48,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:48,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1963 transitions. [2022-04-28 08:41:48,792 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1963 transitions. Word has length 205 [2022-04-28 08:41:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:48,792 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1963 transitions. [2022-04-28 08:41:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:48,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1322 states and 1963 transitions. [2022-04-28 08:41:50,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1963 edges. 1963 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1963 transitions. [2022-04-28 08:41:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-28 08:41:50,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:50,932 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:50,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 08:41:50,932 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1752889520, now seen corresponding path program 1 times [2022-04-28 08:41:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:50,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695444304] [2022-04-28 08:41:50,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1752889520, now seen corresponding path program 2 times [2022-04-28 08:41:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:50,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129725083] [2022-04-28 08:41:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:51,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {185450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {185443#true} is VALID [2022-04-28 08:41:51,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {185443#true} assume true; {185443#true} is VALID [2022-04-28 08:41:51,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185443#true} {185443#true} #592#return; {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {185443#true} call ULTIMATE.init(); {185450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:41:51,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {185450#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {185443#true} assume true; {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185443#true} {185443#true} #592#return; {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {185443#true} call #t~ret159 := main(); {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {185443#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {185443#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {185443#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {185443#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {185443#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {185443#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {185443#true} is VALID [2022-04-28 08:41:51,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {185443#true} assume 12292 == #t~mem43;havoc #t~mem43; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {185443#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {185443#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {185443#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {185443#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {185443#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {185443#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {185443#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {185443#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {185443#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {185443#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-28 08:41:51,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {185443#true} assume 4368 == #t~mem48;havoc #t~mem48; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {185443#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {185443#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {185443#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {185443#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {185443#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-28 08:41:51,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {185443#true} assume 4384 == #t~mem50;havoc #t~mem50; {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {185443#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {185443#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {185443#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {185443#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {185443#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {185443#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 66: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 67: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {185443#true} assume 4400 == #t~mem52;havoc #t~mem52; {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {185443#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {185443#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {185443#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {185443#true} assume !(~ret~0 <= 0); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 75: Hoare triple {185443#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 76: Hoare triple {185443#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 78: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 80: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 81: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 82: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 83: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,137 INFO L290 TraceCheckUtils]: 85: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 86: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 87: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 88: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 89: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 90: Hoare triple {185443#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 91: Hoare triple {185443#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 92: Hoare triple {185443#true} assume 4416 == #t~mem54;havoc #t~mem54; {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 93: Hoare triple {185443#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 94: Hoare triple {185443#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 95: Hoare triple {185443#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 96: Hoare triple {185443#true} assume !(0 == ~tmp___6~0); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 97: Hoare triple {185443#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 98: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 99: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-28 08:41:51,138 INFO L290 TraceCheckUtils]: 100: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 101: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 102: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 103: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 104: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 105: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 106: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 107: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 108: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 109: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 110: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 111: Hoare triple {185443#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 112: Hoare triple {185443#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 113: Hoare triple {185443#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,139 INFO L290 TraceCheckUtils]: 114: Hoare triple {185443#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 115: Hoare triple {185443#true} assume 4432 == #t~mem56;havoc #t~mem56; {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 116: Hoare triple {185443#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 117: Hoare triple {185443#true} assume !(5 == ~blastFlag~0); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 118: Hoare triple {185443#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 119: Hoare triple {185443#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 120: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 121: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 122: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 123: Hoare triple {185443#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 124: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 125: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 126: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 127: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 128: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,140 INFO L290 TraceCheckUtils]: 129: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 130: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 131: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 132: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 133: Hoare triple {185443#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 134: Hoare triple {185443#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 135: Hoare triple {185443#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 136: Hoare triple {185443#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 137: Hoare triple {185443#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 138: Hoare triple {185443#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 139: Hoare triple {185443#true} assume 4448 == #t~mem58;havoc #t~mem58; {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 140: Hoare triple {185443#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 141: Hoare triple {185443#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {185443#true} is VALID [2022-04-28 08:41:51,141 INFO L290 TraceCheckUtils]: 142: Hoare triple {185443#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {185443#true} is VALID [2022-04-28 08:41:51,142 INFO L290 TraceCheckUtils]: 143: Hoare triple {185443#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,143 INFO L290 TraceCheckUtils]: 144: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,143 INFO L290 TraceCheckUtils]: 145: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,143 INFO L290 TraceCheckUtils]: 146: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,144 INFO L290 TraceCheckUtils]: 147: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,144 INFO L290 TraceCheckUtils]: 148: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,144 INFO L290 TraceCheckUtils]: 149: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,144 INFO L290 TraceCheckUtils]: 150: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,145 INFO L290 TraceCheckUtils]: 151: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,145 INFO L290 TraceCheckUtils]: 152: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,145 INFO L290 TraceCheckUtils]: 153: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,145 INFO L290 TraceCheckUtils]: 154: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,146 INFO L290 TraceCheckUtils]: 155: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,146 INFO L290 TraceCheckUtils]: 156: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,146 INFO L290 TraceCheckUtils]: 157: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,146 INFO L290 TraceCheckUtils]: 158: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,147 INFO L290 TraceCheckUtils]: 159: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,147 INFO L290 TraceCheckUtils]: 160: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,147 INFO L290 TraceCheckUtils]: 161: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,147 INFO L290 TraceCheckUtils]: 162: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,148 INFO L290 TraceCheckUtils]: 163: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,148 INFO L290 TraceCheckUtils]: 164: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,148 INFO L290 TraceCheckUtils]: 165: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,148 INFO L290 TraceCheckUtils]: 166: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,149 INFO L290 TraceCheckUtils]: 167: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,149 INFO L290 TraceCheckUtils]: 168: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,149 INFO L290 TraceCheckUtils]: 169: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,149 INFO L290 TraceCheckUtils]: 170: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,150 INFO L290 TraceCheckUtils]: 171: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,150 INFO L290 TraceCheckUtils]: 172: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,150 INFO L290 TraceCheckUtils]: 173: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,150 INFO L290 TraceCheckUtils]: 174: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,151 INFO L290 TraceCheckUtils]: 175: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,151 INFO L290 TraceCheckUtils]: 176: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:41:51,151 INFO L290 TraceCheckUtils]: 177: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4528 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {185449#(not (= |ssl3_connect_#t~mem71| 4529))} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 178: Hoare triple {185449#(not (= |ssl3_connect_#t~mem71| 4529))} assume 4529 == #t~mem71;havoc #t~mem71; {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 179: Hoare triple {185444#false} assume -2147483648 <= #t~nondet123 && #t~nondet123 <= 2147483647;~ret~0 := #t~nondet123;havoc #t~nondet123; {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 180: Hoare triple {185444#false} assume !(~ret~0 <= 0);call write~int(4352, ~s.base, 52 + ~s.offset, 4);call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem125 := read~int(#t~mem124.base, #t~mem124.offset, 4);call write~int((if 0 == #t~mem125 then 0 else (if 1 == #t~mem125 then ~bitwiseAnd(#t~mem125, -5) else ~bitwiseAnd(#t~mem125, -5))), #t~mem124.base, #t~mem124.offset, 4);havoc #t~mem124.base, #t~mem124.offset;havoc #t~mem125;call #t~mem126 := read~int(~s.base, 92 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 181: Hoare triple {185444#false} assume !(0 != #t~mem126);havoc #t~mem126;call #t~mem133.base, #t~mem133.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(4560, #t~mem133.base, 844 + #t~mem133.offset, 4);havoc #t~mem133.base, #t~mem133.offset; {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 182: Hoare triple {185444#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 183: Hoare triple {185444#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 184: Hoare triple {185444#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 185: Hoare triple {185444#false} ~skip~0 := 0; {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 186: Hoare triple {185444#false} assume !false; {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 187: Hoare triple {185444#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 188: Hoare triple {185444#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 189: Hoare triple {185444#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 190: Hoare triple {185444#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,152 INFO L290 TraceCheckUtils]: 191: Hoare triple {185444#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 192: Hoare triple {185444#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 193: Hoare triple {185444#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 194: Hoare triple {185444#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 195: Hoare triple {185444#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 196: Hoare triple {185444#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 197: Hoare triple {185444#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 198: Hoare triple {185444#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 199: Hoare triple {185444#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 200: Hoare triple {185444#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 201: Hoare triple {185444#false} assume 4432 == #t~mem56;havoc #t~mem56; {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 202: Hoare triple {185444#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 203: Hoare triple {185444#false} assume 5 == ~blastFlag~0; {185444#false} is VALID [2022-04-28 08:41:51,153 INFO L290 TraceCheckUtils]: 204: Hoare triple {185444#false} assume !false; {185444#false} is VALID [2022-04-28 08:41:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:41:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129725083] [2022-04-28 08:41:51,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129725083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:51,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:51,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:51,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695444304] [2022-04-28 08:41:51,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695444304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:51,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:51,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000712357] [2022-04-28 08:41:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-28 08:41:51,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:51,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:51,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:51,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:51,253 INFO L87 Difference]: Start difference. First operand 1322 states and 1963 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:53,272 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-28 08:41:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:54,649 INFO L93 Difference]: Finished difference Result 2879 states and 4216 transitions. [2022-04-28 08:41:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-28 08:41:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 08:41:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 08:41:54,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 08:41:54,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:55,040 INFO L225 Difference]: With dead ends: 2879 [2022-04-28 08:41:55,040 INFO L226 Difference]: Without dead ends: 1573 [2022-04-28 08:41:55,042 INFO L412 NwaCegarLoop]: 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-28 08:41:55,042 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 86 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:55,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 286 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:41:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-04-28 08:41:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1327. [2022-04-28 08:41:55,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:55,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:55,164 INFO L74 IsIncluded]: Start isIncluded. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:55,165 INFO L87 Difference]: Start difference. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:55,236 INFO L93 Difference]: Finished difference Result 1573 states and 2268 transitions. [2022-04-28 08:41:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2268 transitions. [2022-04-28 08:41:55,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:55,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:55,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1573 states. [2022-04-28 08:41:55,240 INFO L87 Difference]: Start difference. First operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1573 states. [2022-04-28 08:41:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:55,311 INFO L93 Difference]: Finished difference Result 1573 states and 2268 transitions. [2022-04-28 08:41:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2268 transitions. [2022-04-28 08:41:55,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:55,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:55,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:55,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1968 transitions. [2022-04-28 08:41:55,386 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1968 transitions. Word has length 205 [2022-04-28 08:41:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:55,387 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1968 transitions. [2022-04-28 08:41:55,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:55,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1327 states and 1968 transitions. [2022-04-28 08:41:57,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1968 edges. 1968 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1968 transitions. [2022-04-28 08:41:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-28 08:41:57,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:57,596 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 08:41:57,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 08:41:57,596 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 1 times [2022-04-28 08:41:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:57,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121722306] [2022-04-28 08:42:16,611 WARN L232 SmtUtils]: Spent 18.67s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:42:31,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 2 times [2022-04-28 08:42:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:31,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116744016] [2022-04-28 08:42:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:31,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {197020#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {197013#true} is VALID [2022-04-28 08:42:31,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {197013#true} assume true; {197013#true} is VALID [2022-04-28 08:42:31,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197013#true} {197013#true} #592#return; {197013#true} is VALID [2022-04-28 08:42:31,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {197013#true} call ULTIMATE.init(); {197020#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:42:31,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {197020#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {197013#true} is VALID [2022-04-28 08:42:31,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {197013#true} assume true; {197013#true} is VALID [2022-04-28 08:42:31,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197013#true} {197013#true} #592#return; {197013#true} is VALID [2022-04-28 08:42:31,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {197013#true} call #t~ret159 := main(); {197013#true} is VALID [2022-04-28 08:42:31,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {197013#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {197013#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {197013#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {197013#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {197013#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {197013#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {197013#true} assume 12292 == #t~mem43;havoc #t~mem43; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {197013#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {197013#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {197013#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {197013#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {197013#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {197013#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {197013#true} is VALID [2022-04-28 08:42:31,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {197013#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {197013#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {197013#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {197013#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {197013#true} assume 4368 == #t~mem48;havoc #t~mem48; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {197013#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {197013#true} is VALID [2022-04-28 08:42:31,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {197013#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {197013#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {197013#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {197013#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {197013#true} assume 4384 == #t~mem50;havoc #t~mem50; {197013#true} is VALID [2022-04-28 08:42:31,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {197013#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {197013#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {197013#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {197013#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {197013#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {197013#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {197013#true} assume 4400 == #t~mem52;havoc #t~mem52; {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {197013#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 72: Hoare triple {197013#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 73: Hoare triple {197013#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 74: Hoare triple {197013#true} assume !(~ret~0 <= 0); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {197013#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {197013#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 77: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 78: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 79: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 81: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 82: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 83: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 84: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 85: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 86: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 87: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 89: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 90: Hoare triple {197013#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 91: Hoare triple {197013#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 92: Hoare triple {197013#true} assume 4416 == #t~mem54;havoc #t~mem54; {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 93: Hoare triple {197013#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 94: Hoare triple {197013#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {197013#true} is VALID [2022-04-28 08:42:31,745 INFO L290 TraceCheckUtils]: 95: Hoare triple {197013#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 96: Hoare triple {197013#true} assume !(0 == ~tmp___6~0); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {197013#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 101: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 102: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 103: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 104: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 105: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 106: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 107: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 108: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 109: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,746 INFO L290 TraceCheckUtils]: 110: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 111: Hoare triple {197013#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 112: Hoare triple {197013#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 113: Hoare triple {197013#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 114: Hoare triple {197013#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 115: Hoare triple {197013#true} assume 4432 == #t~mem56;havoc #t~mem56; {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 116: Hoare triple {197013#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 117: Hoare triple {197013#true} assume !(5 == ~blastFlag~0); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 118: Hoare triple {197013#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 119: Hoare triple {197013#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 120: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 121: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 122: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 123: Hoare triple {197013#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,747 INFO L290 TraceCheckUtils]: 124: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 125: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 126: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 127: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 128: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 129: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 130: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 131: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 132: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 133: Hoare triple {197013#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 134: Hoare triple {197013#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 135: Hoare triple {197013#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 136: Hoare triple {197013#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 137: Hoare triple {197013#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 138: Hoare triple {197013#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,748 INFO L290 TraceCheckUtils]: 139: Hoare triple {197013#true} assume 4448 == #t~mem58;havoc #t~mem58; {197013#true} is VALID [2022-04-28 08:42:31,749 INFO L290 TraceCheckUtils]: 140: Hoare triple {197013#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {197013#true} is VALID [2022-04-28 08:42:31,749 INFO L290 TraceCheckUtils]: 141: Hoare triple {197013#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {197013#true} is VALID [2022-04-28 08:42:31,749 INFO L290 TraceCheckUtils]: 142: Hoare triple {197013#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {197013#true} is VALID [2022-04-28 08:42:31,749 INFO L290 TraceCheckUtils]: 143: Hoare triple {197013#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,750 INFO L290 TraceCheckUtils]: 144: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,750 INFO L290 TraceCheckUtils]: 145: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,751 INFO L290 TraceCheckUtils]: 146: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,751 INFO L290 TraceCheckUtils]: 147: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,751 INFO L290 TraceCheckUtils]: 148: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,751 INFO L290 TraceCheckUtils]: 149: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,752 INFO L290 TraceCheckUtils]: 150: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,752 INFO L290 TraceCheckUtils]: 151: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,752 INFO L290 TraceCheckUtils]: 152: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,753 INFO L290 TraceCheckUtils]: 153: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,753 INFO L290 TraceCheckUtils]: 154: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,753 INFO L290 TraceCheckUtils]: 155: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,753 INFO L290 TraceCheckUtils]: 156: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,754 INFO L290 TraceCheckUtils]: 157: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,754 INFO L290 TraceCheckUtils]: 158: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:31,754 INFO L290 TraceCheckUtils]: 159: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197019#(not (= |ssl3_connect_#t~mem53| 4401))} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 160: Hoare triple {197019#(not (= |ssl3_connect_#t~mem53| 4401))} assume 4401 == #t~mem53;havoc #t~mem53; {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 161: Hoare triple {197014#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 162: Hoare triple {197014#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 163: Hoare triple {197014#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 164: Hoare triple {197014#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 165: Hoare triple {197014#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 166: Hoare triple {197014#false} ~skip~0 := 0; {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 167: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 168: Hoare triple {197014#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 169: Hoare triple {197014#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 170: Hoare triple {197014#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 171: Hoare triple {197014#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,755 INFO L290 TraceCheckUtils]: 172: Hoare triple {197014#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 173: Hoare triple {197014#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 174: Hoare triple {197014#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 175: Hoare triple {197014#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 176: Hoare triple {197014#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 177: Hoare triple {197014#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 178: Hoare triple {197014#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 179: Hoare triple {197014#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 180: Hoare triple {197014#false} assume 4416 == #t~mem54;havoc #t~mem54; {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 181: Hoare triple {197014#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 182: Hoare triple {197014#false} assume !(3 == ~blastFlag~0); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 183: Hoare triple {197014#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 184: Hoare triple {197014#false} assume !(0 == ~tmp___6~0); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 185: Hoare triple {197014#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 186: Hoare triple {197014#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 187: Hoare triple {197014#false} ~skip~0 := 0; {197014#false} is VALID [2022-04-28 08:42:31,756 INFO L290 TraceCheckUtils]: 188: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 189: Hoare triple {197014#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 190: Hoare triple {197014#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 191: Hoare triple {197014#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 192: Hoare triple {197014#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 193: Hoare triple {197014#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 194: Hoare triple {197014#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 195: Hoare triple {197014#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 196: Hoare triple {197014#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 197: Hoare triple {197014#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 198: Hoare triple {197014#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 199: Hoare triple {197014#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 200: Hoare triple {197014#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 201: Hoare triple {197014#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 202: Hoare triple {197014#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-28 08:42:31,757 INFO L290 TraceCheckUtils]: 203: Hoare triple {197014#false} assume 4432 == #t~mem56;havoc #t~mem56; {197014#false} is VALID [2022-04-28 08:42:31,758 INFO L290 TraceCheckUtils]: 204: Hoare triple {197014#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {197014#false} is VALID [2022-04-28 08:42:31,758 INFO L290 TraceCheckUtils]: 205: Hoare triple {197014#false} assume 5 == ~blastFlag~0; {197014#false} is VALID [2022-04-28 08:42:31,758 INFO L290 TraceCheckUtils]: 206: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-28 08:42:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-28 08:42:31,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:31,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116744016] [2022-04-28 08:42:31,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116744016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:31,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:31,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:31,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:31,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121722306] [2022-04-28 08:42:31,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121722306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:31,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:31,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370533937] [2022-04-28 08:42:31,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:31,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 207 [2022-04-28 08:42:31,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:31,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:31,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:31,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:31,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:31,831 INFO L87 Difference]: Start difference. First operand 1327 states and 1968 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:33,857 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-28 08:42:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:35,304 INFO L93 Difference]: Finished difference Result 2884 states and 4216 transitions. [2022-04-28 08:42:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 207 [2022-04-28 08:42:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-28 08:42:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-28 08:42:35,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-28 08:42:35,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:35,692 INFO L225 Difference]: With dead ends: 2884 [2022-04-28 08:42:35,692 INFO L226 Difference]: Without dead ends: 1573 [2022-04-28 08:42:35,694 INFO L412 NwaCegarLoop]: 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-28 08:42:35,694 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 103 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 298 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-28 08:42:35,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 298 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:42:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-04-28 08:42:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1327. [2022-04-28 08:42:35,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:35,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:35,829 INFO L74 IsIncluded]: Start isIncluded. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:35,830 INFO L87 Difference]: Start difference. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:35,901 INFO L93 Difference]: Finished difference Result 1573 states and 2253 transitions. [2022-04-28 08:42:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2253 transitions. [2022-04-28 08:42:35,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:35,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:35,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 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 1573 states. [2022-04-28 08:42:35,905 INFO L87 Difference]: Start difference. First operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 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 1573 states. [2022-04-28 08:42:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:35,976 INFO L93 Difference]: Finished difference Result 1573 states and 2253 transitions. [2022-04-28 08:42:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2253 transitions. [2022-04-28 08:42:35,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:35,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:35,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:35,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1953 transitions. [2022-04-28 08:42:36,057 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1953 transitions. Word has length 207 [2022-04-28 08:42:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:36,057 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1953 transitions. [2022-04-28 08:42:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:36,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1327 states and 1953 transitions. [2022-04-28 08:42:38,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1953 edges. 1953 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1953 transitions. [2022-04-28 08:42:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-28 08:42:38,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:38,348 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:38,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 08:42:38,349 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1171434757, now seen corresponding path program 1 times [2022-04-28 08:42:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:38,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363873877] [2022-04-28 08:42:38,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1171434757, now seen corresponding path program 2 times [2022-04-28 08:42:38,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:38,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425788170] [2022-04-28 08:42:38,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:38,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:38,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {208600#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {208593#true} is VALID [2022-04-28 08:42:38,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {208593#true} assume true; {208593#true} is VALID [2022-04-28 08:42:38,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208593#true} {208593#true} #592#return; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {208593#true} call ULTIMATE.init(); {208600#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:42:38,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {208600#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {208593#true} assume true; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208593#true} {208593#true} #592#return; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {208593#true} call #t~ret159 := main(); {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {208593#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {208593#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {208593#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {208593#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {208593#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {208593#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {208593#true} assume 12292 == #t~mem43;havoc #t~mem43; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {208593#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {208593#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {208593#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {208593#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {208593#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {208593#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {208593#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {208593#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {208593#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {208593#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {208593#true} assume 4368 == #t~mem48;havoc #t~mem48; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {208593#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {208593#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {208593#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {208593#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {208593#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {208593#true} assume 4384 == #t~mem50;havoc #t~mem50; {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {208593#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {208593#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {208593#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {208593#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {208593#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {208593#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {208593#true} assume 4400 == #t~mem52;havoc #t~mem52; {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {208593#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,561 INFO L290 TraceCheckUtils]: 72: Hoare triple {208593#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {208593#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {208593#true} assume !(~ret~0 <= 0); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {208593#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {208593#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 78: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 84: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 85: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 86: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,562 INFO L290 TraceCheckUtils]: 87: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {208593#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {208593#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {208593#true} assume 4416 == #t~mem54;havoc #t~mem54; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 93: Hoare triple {208593#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {208593#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 95: Hoare triple {208593#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 96: Hoare triple {208593#true} assume !(0 == ~tmp___6~0); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 97: Hoare triple {208593#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 98: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 99: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 100: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 101: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,563 INFO L290 TraceCheckUtils]: 102: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 103: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 104: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 106: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 107: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 108: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 109: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 111: Hoare triple {208593#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 112: Hoare triple {208593#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 113: Hoare triple {208593#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 114: Hoare triple {208593#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 115: Hoare triple {208593#true} assume 4432 == #t~mem56;havoc #t~mem56; {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 116: Hoare triple {208593#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {208593#true} is VALID [2022-04-28 08:42:38,564 INFO L290 TraceCheckUtils]: 117: Hoare triple {208593#true} assume !(5 == ~blastFlag~0); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 118: Hoare triple {208593#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 119: Hoare triple {208593#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 120: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 121: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 122: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 123: Hoare triple {208593#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 124: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 125: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 126: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 127: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 128: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 129: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 130: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 131: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,565 INFO L290 TraceCheckUtils]: 132: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 133: Hoare triple {208593#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 134: Hoare triple {208593#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 135: Hoare triple {208593#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 136: Hoare triple {208593#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 137: Hoare triple {208593#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 138: Hoare triple {208593#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 139: Hoare triple {208593#true} assume 4448 == #t~mem58;havoc #t~mem58; {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 140: Hoare triple {208593#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 141: Hoare triple {208593#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {208593#true} is VALID [2022-04-28 08:42:38,566 INFO L290 TraceCheckUtils]: 142: Hoare triple {208593#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {208593#true} is VALID [2022-04-28 08:42:38,567 INFO L290 TraceCheckUtils]: 143: Hoare triple {208593#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,568 INFO L290 TraceCheckUtils]: 144: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,568 INFO L290 TraceCheckUtils]: 145: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,568 INFO L290 TraceCheckUtils]: 146: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,569 INFO L290 TraceCheckUtils]: 147: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,569 INFO L290 TraceCheckUtils]: 148: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,569 INFO L290 TraceCheckUtils]: 149: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,570 INFO L290 TraceCheckUtils]: 150: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,570 INFO L290 TraceCheckUtils]: 151: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,570 INFO L290 TraceCheckUtils]: 152: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,571 INFO L290 TraceCheckUtils]: 153: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,571 INFO L290 TraceCheckUtils]: 154: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,571 INFO L290 TraceCheckUtils]: 155: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,571 INFO L290 TraceCheckUtils]: 156: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,572 INFO L290 TraceCheckUtils]: 157: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,572 INFO L290 TraceCheckUtils]: 158: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,572 INFO L290 TraceCheckUtils]: 159: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,573 INFO L290 TraceCheckUtils]: 160: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,573 INFO L290 TraceCheckUtils]: 161: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,573 INFO L290 TraceCheckUtils]: 162: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,574 INFO L290 TraceCheckUtils]: 163: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,574 INFO L290 TraceCheckUtils]: 164: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,574 INFO L290 TraceCheckUtils]: 165: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 166: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208599#(= |ssl3_connect_#t~mem60| 4464)} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 167: Hoare triple {208599#(= |ssl3_connect_#t~mem60| 4464)} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 168: Hoare triple {208594#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 169: Hoare triple {208594#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 170: Hoare triple {208594#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 171: Hoare triple {208594#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 172: Hoare triple {208594#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 173: Hoare triple {208594#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,575 INFO L290 TraceCheckUtils]: 174: Hoare triple {208594#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 175: Hoare triple {208594#false} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 176: Hoare triple {208594#false} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 177: Hoare triple {208594#false} assume !(4528 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 178: Hoare triple {208594#false} assume !(4529 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 179: Hoare triple {208594#false} assume !(4560 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 180: Hoare triple {208594#false} assume !(4561 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 181: Hoare triple {208594#false} assume 4352 == #t~mem74;havoc #t~mem74; {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 182: Hoare triple {208594#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~num1~0 := #t~nondet136;havoc #t~nondet136; {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 183: Hoare triple {208594#false} assume !(~num1~0 > 0); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 184: Hoare triple {208594#false} call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem139 := read~int(#t~mem138.base, 844 + #t~mem138.offset, 4);call write~int(#t~mem139, ~s.base, 52 + ~s.offset, 4);havoc #t~mem138.base, #t~mem138.offset;havoc #t~mem139; {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 185: Hoare triple {208594#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 186: Hoare triple {208594#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 187: Hoare triple {208594#false} ~skip~0 := 0; {208594#false} is VALID [2022-04-28 08:42:38,576 INFO L290 TraceCheckUtils]: 188: Hoare triple {208594#false} assume !false; {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 189: Hoare triple {208594#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 190: Hoare triple {208594#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 191: Hoare triple {208594#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 192: Hoare triple {208594#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 193: Hoare triple {208594#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 194: Hoare triple {208594#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 195: Hoare triple {208594#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 196: Hoare triple {208594#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 197: Hoare triple {208594#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 198: Hoare triple {208594#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 199: Hoare triple {208594#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 200: Hoare triple {208594#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 201: Hoare triple {208594#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 202: Hoare triple {208594#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-28 08:42:38,577 INFO L290 TraceCheckUtils]: 203: Hoare triple {208594#false} assume 4432 == #t~mem56;havoc #t~mem56; {208594#false} is VALID [2022-04-28 08:42:38,578 INFO L290 TraceCheckUtils]: 204: Hoare triple {208594#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {208594#false} is VALID [2022-04-28 08:42:38,578 INFO L290 TraceCheckUtils]: 205: Hoare triple {208594#false} assume 5 == ~blastFlag~0; {208594#false} is VALID [2022-04-28 08:42:38,578 INFO L290 TraceCheckUtils]: 206: Hoare triple {208594#false} assume !false; {208594#false} is VALID [2022-04-28 08:42:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:42:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:38,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425788170] [2022-04-28 08:42:38,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425788170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:38,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:38,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:38,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:38,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363873877] [2022-04-28 08:42:38,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363873877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:38,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:38,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574649989] [2022-04-28 08:42:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-28 08:42:38,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:38,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:38,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:38,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:38,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:38,664 INFO L87 Difference]: Start difference. First operand 1327 states and 1953 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:40,685 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-28 08:42:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:42,211 INFO L93 Difference]: Finished difference Result 2842 states and 4161 transitions. [2022-04-28 08:42:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-28 08:42:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-04-28 08:42:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-04-28 08:42:42,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-04-28 08:42:42,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:42,564 INFO L225 Difference]: With dead ends: 2842 [2022-04-28 08:42:42,564 INFO L226 Difference]: Without dead ends: 1531 [2022-04-28 08:42:42,565 INFO L412 NwaCegarLoop]: 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-28 08:42:42,566 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 35 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:42,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 502 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 410 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:42:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-28 08:42:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1443. [2022-04-28 08:42:42,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:42,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1531 states. Second operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,693 INFO L74 IsIncluded]: Start isIncluded. First operand 1531 states. Second operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,694 INFO L87 Difference]: Start difference. First operand 1531 states. Second operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:42,755 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2022-04-28 08:42:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2224 transitions. [2022-04-28 08:42:42,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:42,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:42,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 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-28 08:42:42,759 INFO L87 Difference]: Start difference. First operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 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-28 08:42:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:42,820 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2022-04-28 08:42:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2224 transitions. [2022-04-28 08:42:42,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:42,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:42,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:42,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2117 transitions. [2022-04-28 08:42:42,923 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2117 transitions. Word has length 207 [2022-04-28 08:42:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:42,923 INFO L495 AbstractCegarLoop]: Abstraction has 1443 states and 2117 transitions. [2022-04-28 08:42:42,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:42,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1443 states and 2117 transitions. [2022-04-28 08:42:45,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2117 edges. 2117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2117 transitions. [2022-04-28 08:42:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-28 08:42:45,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:45,429 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:45,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 08:42:45,429 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1117041859, now seen corresponding path program 1 times [2022-04-28 08:42:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:45,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193382074] [2022-04-28 08:42:45,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1117041859, now seen corresponding path program 2 times [2022-04-28 08:42:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:45,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27164885] [2022-04-28 08:42:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:45,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:45,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {220244#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {220237#true} is VALID [2022-04-28 08:42:45,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {220237#true} assume true; {220237#true} is VALID [2022-04-28 08:42:45,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220237#true} {220237#true} #592#return; {220237#true} is VALID [2022-04-28 08:42:45,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {220237#true} call ULTIMATE.init(); {220244#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:42:45,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {220244#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {220237#true} assume true; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220237#true} {220237#true} #592#return; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {220237#true} call #t~ret159 := main(); {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {220237#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {220237#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {220237#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {220237#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {220237#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {220237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {220237#true} assume 12292 == #t~mem43;havoc #t~mem43; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {220237#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {220237#true} is VALID [2022-04-28 08:42:45,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {220237#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {220237#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {220237#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {220237#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {220237#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {220237#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {220237#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {220237#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {220237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {220237#true} assume 4368 == #t~mem48;havoc #t~mem48; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {220237#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {220237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {220237#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {220237#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {220237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {220237#true} assume 4384 == #t~mem50;havoc #t~mem50; {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {220237#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {220237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {220237#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {220237#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {220237#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {220237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 64: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 70: Hoare triple {220237#true} assume 4400 == #t~mem52;havoc #t~mem52; {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 71: Hoare triple {220237#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 72: Hoare triple {220237#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {220237#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {220237#true} assume !(~ret~0 <= 0); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {220237#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,607 INFO L290 TraceCheckUtils]: 76: Hoare triple {220237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 79: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 83: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 84: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 85: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 86: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 87: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 88: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 89: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {220237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 91: Hoare triple {220237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,608 INFO L290 TraceCheckUtils]: 92: Hoare triple {220237#true} assume 4416 == #t~mem54;havoc #t~mem54; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 93: Hoare triple {220237#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 94: Hoare triple {220237#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 95: Hoare triple {220237#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 96: Hoare triple {220237#true} assume !(0 == ~tmp___6~0); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 97: Hoare triple {220237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 99: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 100: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 101: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 102: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 103: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 104: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 105: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 106: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,609 INFO L290 TraceCheckUtils]: 107: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 108: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 109: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 110: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 111: Hoare triple {220237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 112: Hoare triple {220237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 113: Hoare triple {220237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 114: Hoare triple {220237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 115: Hoare triple {220237#true} assume 4432 == #t~mem56;havoc #t~mem56; {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 116: Hoare triple {220237#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 117: Hoare triple {220237#true} assume !(5 == ~blastFlag~0); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 118: Hoare triple {220237#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 119: Hoare triple {220237#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 120: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-28 08:42:45,610 INFO L290 TraceCheckUtils]: 121: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 122: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 123: Hoare triple {220237#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 124: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 125: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 126: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 127: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 128: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 129: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 130: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 131: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 132: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 133: Hoare triple {220237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 134: Hoare triple {220237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 135: Hoare triple {220237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,611 INFO L290 TraceCheckUtils]: 136: Hoare triple {220237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,612 INFO L290 TraceCheckUtils]: 137: Hoare triple {220237#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,612 INFO L290 TraceCheckUtils]: 138: Hoare triple {220237#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,612 INFO L290 TraceCheckUtils]: 139: Hoare triple {220237#true} assume 4448 == #t~mem58;havoc #t~mem58; {220237#true} is VALID [2022-04-28 08:42:45,612 INFO L290 TraceCheckUtils]: 140: Hoare triple {220237#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {220237#true} is VALID [2022-04-28 08:42:45,612 INFO L290 TraceCheckUtils]: 141: Hoare triple {220237#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {220237#true} is VALID [2022-04-28 08:42:45,612 INFO L290 TraceCheckUtils]: 142: Hoare triple {220237#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {220237#true} is VALID [2022-04-28 08:42:45,613 INFO L290 TraceCheckUtils]: 143: Hoare triple {220237#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,613 INFO L290 TraceCheckUtils]: 144: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,614 INFO L290 TraceCheckUtils]: 145: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,614 INFO L290 TraceCheckUtils]: 146: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,614 INFO L290 TraceCheckUtils]: 147: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,614 INFO L290 TraceCheckUtils]: 148: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,615 INFO L290 TraceCheckUtils]: 149: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,615 INFO L290 TraceCheckUtils]: 150: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,615 INFO L290 TraceCheckUtils]: 151: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,615 INFO L290 TraceCheckUtils]: 152: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,616 INFO L290 TraceCheckUtils]: 153: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,616 INFO L290 TraceCheckUtils]: 154: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,616 INFO L290 TraceCheckUtils]: 155: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,616 INFO L290 TraceCheckUtils]: 156: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,617 INFO L290 TraceCheckUtils]: 157: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,617 INFO L290 TraceCheckUtils]: 158: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,617 INFO L290 TraceCheckUtils]: 159: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,617 INFO L290 TraceCheckUtils]: 160: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,618 INFO L290 TraceCheckUtils]: 161: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,618 INFO L290 TraceCheckUtils]: 162: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,618 INFO L290 TraceCheckUtils]: 163: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,618 INFO L290 TraceCheckUtils]: 164: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,619 INFO L290 TraceCheckUtils]: 165: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,627 INFO L290 TraceCheckUtils]: 166: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,627 INFO L290 TraceCheckUtils]: 167: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,628 INFO L290 TraceCheckUtils]: 168: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,628 INFO L290 TraceCheckUtils]: 169: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,628 INFO L290 TraceCheckUtils]: 170: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,629 INFO L290 TraceCheckUtils]: 171: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,629 INFO L290 TraceCheckUtils]: 172: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,629 INFO L290 TraceCheckUtils]: 173: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,629 INFO L290 TraceCheckUtils]: 174: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,630 INFO L290 TraceCheckUtils]: 175: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,630 INFO L290 TraceCheckUtils]: 176: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,630 INFO L290 TraceCheckUtils]: 177: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4528 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,630 INFO L290 TraceCheckUtils]: 178: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4529 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,631 INFO L290 TraceCheckUtils]: 179: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4560 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:42:45,631 INFO L290 TraceCheckUtils]: 180: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4561 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220243#(not (= 4352 |ssl3_connect_#t~mem74|))} is VALID [2022-04-28 08:42:45,631 INFO L290 TraceCheckUtils]: 181: Hoare triple {220243#(not (= 4352 |ssl3_connect_#t~mem74|))} assume 4352 == #t~mem74;havoc #t~mem74; {220238#false} is VALID [2022-04-28 08:42:45,631 INFO L290 TraceCheckUtils]: 182: Hoare triple {220238#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~num1~0 := #t~nondet136;havoc #t~nondet136; {220238#false} is VALID [2022-04-28 08:42:45,631 INFO L290 TraceCheckUtils]: 183: Hoare triple {220238#false} assume !(~num1~0 > 0); {220238#false} is VALID [2022-04-28 08:42:45,631 INFO L290 TraceCheckUtils]: 184: Hoare triple {220238#false} call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem139 := read~int(#t~mem138.base, 844 + #t~mem138.offset, 4);call write~int(#t~mem139, ~s.base, 52 + ~s.offset, 4);havoc #t~mem138.base, #t~mem138.offset;havoc #t~mem139; {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 185: Hoare triple {220238#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 186: Hoare triple {220238#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 187: Hoare triple {220238#false} ~skip~0 := 0; {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 188: Hoare triple {220238#false} assume !false; {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 189: Hoare triple {220238#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 190: Hoare triple {220238#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 191: Hoare triple {220238#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 192: Hoare triple {220238#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 193: Hoare triple {220238#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 194: Hoare triple {220238#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 195: Hoare triple {220238#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 196: Hoare triple {220238#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 197: Hoare triple {220238#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 198: Hoare triple {220238#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,632 INFO L290 TraceCheckUtils]: 199: Hoare triple {220238#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 200: Hoare triple {220238#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 201: Hoare triple {220238#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 202: Hoare triple {220238#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 203: Hoare triple {220238#false} assume 4432 == #t~mem56;havoc #t~mem56; {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 204: Hoare triple {220238#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 205: Hoare triple {220238#false} assume 5 == ~blastFlag~0; {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L290 TraceCheckUtils]: 206: Hoare triple {220238#false} assume !false; {220238#false} is VALID [2022-04-28 08:42:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 08:42:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:45,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27164885] [2022-04-28 08:42:45,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27164885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:45,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:45,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:45,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:45,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193382074] [2022-04-28 08:42:45,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193382074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:45,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:45,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973847834] [2022-04-28 08:42:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-28 08:42:45,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:45,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:45,721 INFO L87 Difference]: Start difference. First operand 1443 states and 2117 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:47,740 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-28 08:42:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:49,276 INFO L93 Difference]: Finished difference Result 3096 states and 4489 transitions. [2022-04-28 08:42:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-28 08:42:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-28 08:42:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-28 08:42:49,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-28 08:42:49,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:49,676 INFO L225 Difference]: With dead ends: 3096 [2022-04-28 08:42:49,676 INFO L226 Difference]: Without dead ends: 1664 [2022-04-28 08:42:49,678 INFO L412 NwaCegarLoop]: 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-28 08:42:49,678 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 80 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:49,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 292 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 376 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:42:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-04-28 08:42:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1453. [2022-04-28 08:42:49,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:49,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:49,812 INFO L74 IsIncluded]: Start isIncluded. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:49,813 INFO L87 Difference]: Start difference. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:49,891 INFO L93 Difference]: Finished difference Result 1664 states and 2382 transitions. [2022-04-28 08:42:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2382 transitions. [2022-04-28 08:42:49,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:49,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:49,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 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 1664 states. [2022-04-28 08:42:49,895 INFO L87 Difference]: Start difference. First operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 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 1664 states. [2022-04-28 08:42:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:49,974 INFO L93 Difference]: Finished difference Result 1664 states and 2382 transitions. [2022-04-28 08:42:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2382 transitions. [2022-04-28 08:42:49,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:49,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:49,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:49,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2132 transitions. [2022-04-28 08:42:50,090 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2132 transitions. Word has length 207 [2022-04-28 08:42:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:50,090 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2132 transitions. [2022-04-28 08:42:50,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:50,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1453 states and 2132 transitions. [2022-04-28 08:42:52,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2132 edges. 2132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2132 transitions. [2022-04-28 08:42:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-28 08:42:52,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:52,670 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 08:42:52,671 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1085024224, now seen corresponding path program 1 times [2022-04-28 08:42:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:52,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344954469] [2022-04-28 08:43:19,624 WARN L232 SmtUtils]: Spent 26.59s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:43:30,044 WARN L232 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:43:37,996 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:43:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1085024224, now seen corresponding path program 2 times [2022-04-28 08:43:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:37,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908882061] [2022-04-28 08:43:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:38,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {232682#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {232675#true} is VALID [2022-04-28 08:43:38,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {232675#true} assume true; {232675#true} is VALID [2022-04-28 08:43:38,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232675#true} {232675#true} #592#return; {232675#true} is VALID [2022-04-28 08:43:38,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {232675#true} call ULTIMATE.init(); {232682#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-28 08:43:38,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {232682#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {232675#true} is VALID [2022-04-28 08:43:38,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {232675#true} assume true; {232675#true} is VALID [2022-04-28 08:43:38,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232675#true} {232675#true} #592#return; {232675#true} is VALID [2022-04-28 08:43:38,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {232675#true} call #t~ret159 := main(); {232675#true} is VALID [2022-04-28 08:43:38,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {232675#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {232675#true} is VALID [2022-04-28 08:43:38,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {232675#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {232675#true} is VALID [2022-04-28 08:43:38,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {232675#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {232675#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {232675#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {232675#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {232675#true} assume 12292 == #t~mem43;havoc #t~mem43; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {232675#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {232675#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {232675#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {232675#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {232675#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {232675#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {232675#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {232675#true} is VALID [2022-04-28 08:43:38,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {232675#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {232675#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {232675#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {232675#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {232675#true} ~skip~0 := 0; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {232675#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {232675#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {232675#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {232675#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {232675#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {232675#true} assume 4368 == #t~mem48;havoc #t~mem48; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {232675#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {232675#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {232675#true} is VALID [2022-04-28 08:43:38,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {232675#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {232675#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {232675#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {232675#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {232675#true} ~skip~0 := 0; {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {232675#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {232675#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {232675#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {232675#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {232675#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {232675#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {232675#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {232675#true} assume 4384 == #t~mem50;havoc #t~mem50; {232675#true} is VALID [2022-04-28 08:43:38,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {232675#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {232675#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {232675#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {232675#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {232675#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {232675#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {232675#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {232675#true} ~skip~0 := 0; {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {232675#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {232675#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {232675#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {232675#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {232675#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {232675#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {232675#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {232675#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {232675#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {232675#true} assume 4400 == #t~mem52;havoc #t~mem52; {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {232675#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {232675#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {232675#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {232675#true} assume !(~ret~0 <= 0); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {232675#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {232675#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {232675#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {232675#true} ~skip~0 := 0; {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {232675#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {232675#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {232675#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 84: Hoare triple {232675#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {232675#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {232675#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {232675#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {232675#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {232675#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 90: Hoare triple {232675#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {232675#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {232675#true} assume 4416 == #t~mem54;havoc #t~mem54; {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {232675#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 94: Hoare triple {232675#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 95: Hoare triple {232675#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {232675#true} is VALID [2022-04-28 08:43:38,212 INFO L290 TraceCheckUtils]: 96: Hoare triple {232675#true} assume !(0 == ~tmp___6~0); {232675#true} is VALID [2022-04-28 08:43:38,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {232675#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {232675#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232675#true} is VALID [2022-04-28 08:43:38,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {232675#true} ~skip~0 := 0; {232675#true} is VALID [2022-04-28 08:43:38,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,215 INFO L290 TraceCheckUtils]: 102: Hoare triple {232675#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,215 INFO L290 TraceCheckUtils]: 103: Hoare triple {232675#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 104: Hoare triple {232675#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 105: Hoare triple {232675#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 106: Hoare triple {232675#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 107: Hoare triple {232675#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {232675#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {232675#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {232675#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {232675#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 112: Hoare triple {232675#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,216 INFO L290 TraceCheckUtils]: 113: Hoare triple {232675#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 114: Hoare triple {232675#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {232675#true} assume 4432 == #t~mem56;havoc #t~mem56; {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 116: Hoare triple {232675#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 117: Hoare triple {232675#true} assume !(5 == ~blastFlag~0); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 118: Hoare triple {232675#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 119: Hoare triple {232675#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 120: Hoare triple {232675#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 121: Hoare triple {232675#true} ~skip~0 := 0; {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 122: Hoare triple {232675#true} assume !false; {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 123: Hoare triple {232675#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 124: Hoare triple {232675#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 125: Hoare triple {232675#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 126: Hoare triple {232675#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 127: Hoare triple {232675#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,217 INFO L290 TraceCheckUtils]: 128: Hoare triple {232675#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 129: Hoare triple {232675#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 130: Hoare triple {232675#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 131: Hoare triple {232675#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 132: Hoare triple {232675#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 133: Hoare triple {232675#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 134: Hoare triple {232675#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 135: Hoare triple {232675#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 136: Hoare triple {232675#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 137: Hoare triple {232675#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 138: Hoare triple {232675#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 139: Hoare triple {232675#true} assume 4448 == #t~mem58;havoc #t~mem58; {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 140: Hoare triple {232675#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 141: Hoare triple {232675#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {232675#true} is VALID [2022-04-28 08:43:38,218 INFO L290 TraceCheckUtils]: 142: Hoare triple {232675#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {232675#true} is VALID [2022-04-28 08:43:38,219 INFO L290 TraceCheckUtils]: 143: Hoare triple {232675#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,220 INFO L290 TraceCheckUtils]: 144: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,220 INFO L290 TraceCheckUtils]: 145: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,220 INFO L290 TraceCheckUtils]: 146: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,221 INFO L290 TraceCheckUtils]: 147: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,221 INFO L290 TraceCheckUtils]: 148: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,221 INFO L290 TraceCheckUtils]: 149: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,222 INFO L290 TraceCheckUtils]: 150: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,222 INFO L290 TraceCheckUtils]: 151: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,222 INFO L290 TraceCheckUtils]: 152: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,222 INFO L290 TraceCheckUtils]: 153: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,223 INFO L290 TraceCheckUtils]: 154: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,223 INFO L290 TraceCheckUtils]: 155: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-28 08:43:38,223 INFO L290 TraceCheckUtils]: 156: Hoare triple {232680#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232681#(not (= |ssl3_connect_#t~mem50| 4384))} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 157: Hoare triple {232681#(not (= |ssl3_connect_#t~mem50| 4384))} assume 4384 == #t~mem50;havoc #t~mem50; {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 158: Hoare triple {232676#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 159: Hoare triple {232676#false} assume !(1 == ~blastFlag~0); {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 160: Hoare triple {232676#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 161: Hoare triple {232676#false} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 162: Hoare triple {232676#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 163: Hoare triple {232676#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 164: Hoare triple {232676#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 165: Hoare triple {232676#false} ~skip~0 := 0; {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 166: Hoare triple {232676#false} assume !false; {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 167: Hoare triple {232676#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,224 INFO L290 TraceCheckUtils]: 168: Hoare triple {232676#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 169: Hoare triple {232676#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 170: Hoare triple {232676#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 171: Hoare triple {232676#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 172: Hoare triple {232676#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 173: Hoare triple {232676#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 174: Hoare triple {232676#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 175: Hoare triple {232676#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 176: Hoare triple {232676#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 177: Hoare triple {232676#false} assume 4400 == #t~mem52;havoc #t~mem52; {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 178: Hoare triple {232676#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 179: Hoare triple {232676#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 180: Hoare triple {232676#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 181: Hoare triple {232676#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 182: Hoare triple {232676#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232676#false} is VALID [2022-04-28 08:43:38,225 INFO L290 TraceCheckUtils]: 183: Hoare triple {232676#false} ~skip~0 := 0; {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 184: Hoare triple {232676#false} assume !false; {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 185: Hoare triple {232676#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 186: Hoare triple {232676#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 187: Hoare triple {232676#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 188: Hoare triple {232676#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 189: Hoare triple {232676#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 190: Hoare triple {232676#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 191: Hoare triple {232676#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 192: Hoare triple {232676#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 193: Hoare triple {232676#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 194: Hoare triple {232676#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 195: Hoare triple {232676#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 196: Hoare triple {232676#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 197: Hoare triple {232676#false} assume 4416 == #t~mem54;havoc #t~mem54; {232676#false} is VALID [2022-04-28 08:43:38,226 INFO L290 TraceCheckUtils]: 198: Hoare triple {232676#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 199: Hoare triple {232676#false} assume !(3 == ~blastFlag~0); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 200: Hoare triple {232676#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 201: Hoare triple {232676#false} assume !(0 == ~tmp___6~0); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 202: Hoare triple {232676#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 203: Hoare triple {232676#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 204: Hoare triple {232676#false} ~skip~0 := 0; {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 205: Hoare triple {232676#false} assume !false; {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 206: Hoare triple {232676#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 207: Hoare triple {232676#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 208: Hoare triple {232676#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 209: Hoare triple {232676#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 210: Hoare triple {232676#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 211: Hoare triple {232676#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 212: Hoare triple {232676#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,227 INFO L290 TraceCheckUtils]: 213: Hoare triple {232676#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 214: Hoare triple {232676#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 215: Hoare triple {232676#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 216: Hoare triple {232676#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 217: Hoare triple {232676#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 218: Hoare triple {232676#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 219: Hoare triple {232676#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 220: Hoare triple {232676#false} assume 4432 == #t~mem56;havoc #t~mem56; {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 221: Hoare triple {232676#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 222: Hoare triple {232676#false} assume 5 == ~blastFlag~0; {232676#false} is VALID [2022-04-28 08:43:38,228 INFO L290 TraceCheckUtils]: 223: Hoare triple {232676#false} assume !false; {232676#false} is VALID [2022-04-28 08:43:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-28 08:43:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908882061] [2022-04-28 08:43:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908882061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:38,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344954469] [2022-04-28 08:43:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344954469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975541210] [2022-04-28 08:43:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:38,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 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 224 [2022-04-28 08:43:38,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:38,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:38,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:38,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:43:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:43:38,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:43:38,316 INFO L87 Difference]: Start difference. First operand 1453 states and 2132 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:40,335 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-28 08:43:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:41,838 INFO L93 Difference]: Finished difference Result 3101 states and 4494 transitions. [2022-04-28 08:43:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:43:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 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 224 [2022-04-28 08:43:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 08:43:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 08:43:41,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-28 08:43:42,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:42,231 INFO L225 Difference]: With dead ends: 3101 [2022-04-28 08:43:42,231 INFO L226 Difference]: Without dead ends: 1664 [2022-04-28 08:43:42,233 INFO L412 NwaCegarLoop]: 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-28 08:43:42,233 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 99 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:42,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:43:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-04-28 08:43:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1453. [2022-04-28 08:43:42,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:42,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4530386740331491) internal successors, (2104), 1448 states have internal predecessors, (2104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:42,400 INFO L74 IsIncluded]: Start isIncluded. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4530386740331491) internal successors, (2104), 1448 states have internal predecessors, (2104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:42,401 INFO L87 Difference]: Start difference. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4530386740331491) internal successors, (2104), 1448 states have internal predecessors, (2104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:42,480 INFO L93 Difference]: Finished difference Result 1664 states and 2358 transitions. [2022-04-28 08:43:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2358 transitions. [2022-04-28 08:43:42,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:42,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:42,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 1453 states, 1448 states have (on average 1.4530386740331491) internal successors, (2104), 1448 states have internal predecessors, (2104), 3 states have call successors, (3), 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 1664 states. [2022-04-28 08:43:42,483 INFO L87 Difference]: Start difference. First operand has 1453 states, 1448 states have (on average 1.4530386740331491) internal successors, (2104), 1448 states have internal predecessors, (2104), 3 states have call successors, (3), 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 1664 states. [2022-04-28 08:43:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:42,561 INFO L93 Difference]: Finished difference Result 1664 states and 2358 transitions. [2022-04-28 08:43:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2358 transitions. [2022-04-28 08:43:42,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:42,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:42,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:42,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1448 states have (on average 1.4530386740331491) internal successors, (2104), 1448 states have internal predecessors, (2104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2108 transitions. [2022-04-28 08:43:42,653 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2108 transitions. Word has length 224 [2022-04-28 08:43:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:42,654 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2108 transitions. [2022-04-28 08:43:42,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:42,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1453 states and 2108 transitions. [2022-04-28 08:43:45,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2108 edges. 2108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2108 transitions. [2022-04-28 08:43:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-04-28 08:43:45,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:45,269 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:45,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 08:43:45,269 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:45,269 INFO L85 PathProgramCache]: Analyzing trace with hash -496155121, now seen corresponding path program 1 times [2022-04-28 08:43:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:45,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761328589] [2022-04-28 08:44:03,384 WARN L232 SmtUtils]: Spent 17.35s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:44:12,924 WARN L232 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)