/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-e106359-m [2022-04-15 11:31:08,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:31:08,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:31:08,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:31:08,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:31:08,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:31:08,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:31:08,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:31:08,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:31:08,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:31:08,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:31:08,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:31:08,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:31:08,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:31:08,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:31:08,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:31:08,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:31:08,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:31:08,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:31:08,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:31:08,355 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:31:08,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:31:08,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:31:08,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:31:08,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:31:08,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:31:08,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:31:08,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:31:08,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:31:08,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:31:08,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:31:08,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:31:08,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:31:08,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:31:08,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:31:08,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:31:08,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:31:08,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:31:08,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:31:08,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:31:08,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:31:08,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:31:08,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:31:08,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:31:08,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:31:08,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:31:08,390 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:31:08,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:31:08,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:31:08,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:31:08,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:31:08,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:31:08,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:31:08,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:31:08,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:08,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:31:08,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:31:08,393 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:31:08,393 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:31:08,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:31:08,393 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:31:08,393 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:31:08,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:31:08,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:31:08,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:31:08,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:31:08,662 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:31:08,664 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-15 11:31:08,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392abf5b1/98e4fcbaeae74edc989b0523576b8123/FLAG5ff9e3829 [2022-04-15 11:31:09,189 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:31:09,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-15 11:31:09,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392abf5b1/98e4fcbaeae74edc989b0523576b8123/FLAG5ff9e3829 [2022-04-15 11:31:09,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392abf5b1/98e4fcbaeae74edc989b0523576b8123 [2022-04-15 11:31:09,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:31:09,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:31:09,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:09,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:31:09,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:31:09,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:09" (1/1) ... [2022-04-15 11:31:09,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e343d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:09, skipping insertion in model container [2022-04-15 11:31:09,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:31:09" (1/1) ... [2022-04-15 11:31:09,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:31:09,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:31:10,004 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-15 11:31:10,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:10,027 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:31:10,145 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-15 11:31:10,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:31:10,171 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:31:10,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10 WrapperNode [2022-04-15 11:31:10,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:31:10,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:31:10,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:31:10,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:31:10,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:31:10,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:31:10,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:31:10,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:31:10,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (1/1) ... [2022-04-15 11:31:10,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:31:10,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:31:10,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:31:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:31:10,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:31:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:31:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:31:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:31:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:31:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:31:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:31:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:31:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:31:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:31:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:31:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:31:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:31:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:31:10,671 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:31:10,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:31:12,348 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:31:12,865 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:31:12,865 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:31:12,879 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:31:12,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:31:12,887 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:31:12,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:12 BoogieIcfgContainer [2022-04-15 11:31:12,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:31:12,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:31:12,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:31:12,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:31:12,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:31:09" (1/3) ... [2022-04-15 11:31:12,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231d5a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:12, skipping insertion in model container [2022-04-15 11:31:12,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:31:10" (2/3) ... [2022-04-15 11:31:12,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231d5a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:31:12, skipping insertion in model container [2022-04-15 11:31:12,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:31:12" (3/3) ... [2022-04-15 11:31:12,906 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2022-04-15 11:31:12,913 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:31:12,913 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:31:12,960 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:31:12,972 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:31:12,972 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:31:12,991 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-15 11:31:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:31:12,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:13,000 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:13,000 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 1 times [2022-04-15 11:31:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:13,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977610051] [2022-04-15 11:31:13,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 2 times [2022-04-15 11:31:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:13,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132723536] [2022-04-15 11:31:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:13,711 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-15 11:31:13,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-15 11:31:13,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-15 11:31:13,715 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-15 11:31:13,715 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-15 11:31:13,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-15 11:31:13,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-15 11:31:13,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-15 11:31:13,721 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-15 11:31:13,721 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-15 11:31:13,724 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-15 11:31:13,725 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-15 11:31:13,726 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-15 11:31:13,727 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-15 11:31:13,728 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-15 11:31:13,729 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-15 11:31:13,730 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-15 11:31:13,730 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-15 11:31:13,731 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-15 11:31:13,731 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-15 11:31:13,731 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-15 11:31:13,731 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-15 11:31:13,732 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-15 11:31:13,732 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-15 11:31:13,732 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-15 11:31:13,732 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-15 11:31:13,733 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-15 11:31:13,733 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-15 11:31:13,733 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-15 11:31:13,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {144#false} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-15 11:31:13,733 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-15 11:31:13,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-15 11:31:13,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-15 11:31:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:13,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132723536] [2022-04-15 11:31:13,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132723536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:13,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:13,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:13,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977610051] [2022-04-15 11:31:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977610051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:13,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908089394] [2022-04-15 11:31:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:13,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:13,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:13,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:13,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:13,823 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-15 11:31:15,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:17,253 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-04-15 11:31:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:31:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:31:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-15 11:31:17,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-15 11:31:17,668 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-15 11:31:17,679 INFO L225 Difference]: With dead ends: 271 [2022-04-15 11:31:17,680 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 11:31:17,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:17,686 INFO L913 BasicCegarLoop]: 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-15 11:31:17,686 INFO L914 BasicCegarLoop]: 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-15 11:31:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 11:31:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-15 11:31:17,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:17,740 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-15 11:31:17,742 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-15 11:31:17,742 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-15 11:31:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:17,749 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-15 11:31:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-15 11:31:17,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:17,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:17,750 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-15 11:31:17,751 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-15 11:31:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:17,756 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-15 11:31:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-15 11:31:17,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:17,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:17,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:17,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:17,758 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-15 11:31:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-04-15 11:31:17,768 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-04-15 11:31:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:17,768 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-04-15 11:31:17,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:17,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 180 transitions. [2022-04-15 11:31:17,932 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-15 11:31:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-04-15 11:31:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 11:31:17,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:17,934 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:17,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:31:17,934 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash -541033565, now seen corresponding path program 1 times [2022-04-15 11:31:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:17,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540004655] [2022-04-15 11:31:17,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -541033565, now seen corresponding path program 2 times [2022-04-15 11:31:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:17,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610498942] [2022-04-15 11:31:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:18,236 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-15 11:31:18,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 11:31:18,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #592#return; {1191#true} is VALID [2022-04-15 11:31:18,238 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-15 11:31:18,238 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-15 11:31:18,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-15 11:31:18,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #592#return; {1191#true} is VALID [2022-04-15 11:31:18,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret159 := main(); {1191#true} is VALID [2022-04-15 11:31:18,240 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-15 11:31:18,240 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-15 11:31:18,240 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-15 11:31:18,241 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-15 11:31:18,241 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-15 11:31:18,242 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-15 11:31:18,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:18,242 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-15 11:31:18,246 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-15 11:31:18,247 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-15 11:31:18,247 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-15 11:31:18,249 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-15 11:31:18,249 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-15 11:31:18,250 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-15 11:31:18,250 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-15 11:31:18,250 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-15 11:31:18,251 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-15 11:31:18,251 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-15 11:31:18,252 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-15 11:31:18,252 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-15 11:31:18,252 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-15 11:31:18,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:31:18,253 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-15 11:31:18,254 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-15 11:31:18,255 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-15 11:31:18,255 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-15 11:31:18,255 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-15 11:31:18,256 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-15 11:31:18,256 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-15 11:31:18,257 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-15 11:31:18,257 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-15 11:31:18,257 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-15 11:31:18,258 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-15 11:31:18,258 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-15 11:31:18,258 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-15 11:31:18,259 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-15 11:31:18,259 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-15 11:31:18,260 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-15 11:31:18,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1192#false} is VALID [2022-04-15 11:31:18,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-15 11:31:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:18,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610498942] [2022-04-15 11:31:18,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610498942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:18,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:18,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:18,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:18,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540004655] [2022-04-15 11:31:18,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540004655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:18,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:18,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:31:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026889900] [2022-04-15 11:31:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:18,263 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-15 11:31:18,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:18,264 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-15 11:31:18,317 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-15 11:31:18,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:31:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:18,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:31:18,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:18,318 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-15 11:31:20,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:21,200 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-04-15 11:31:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:31:21,200 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-15 11:31:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:21,201 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-15 11:31:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 11:31:21,207 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-15 11:31:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 11:31:21,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-15 11:31:21,640 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-15 11:31:21,649 INFO L225 Difference]: With dead ends: 333 [2022-04-15 11:31:21,649 INFO L226 Difference]: Without dead ends: 226 [2022-04-15 11:31:21,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:31:21,655 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:21,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:31:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-15 11:31:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-04-15 11:31:21,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:21,677 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-15 11:31:21,678 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-15 11:31:21,679 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-15 11:31:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:21,687 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-15 11:31:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-15 11:31:21,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:21,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:21,689 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-15 11:31:21,690 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-15 11:31:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:21,698 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-15 11:31:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-15 11:31:21,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:21,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:21,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:21,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:21,700 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-15 11:31:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-04-15 11:31:21,709 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-04-15 11:31:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:21,710 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-04-15 11:31:21,710 INFO L479 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-15 11:31:21,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 330 transitions. [2022-04-15 11:31:21,955 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-15 11:31:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-15 11:31:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 11:31:21,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:21,957 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:21,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:31:21,958 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -391559510, now seen corresponding path program 1 times [2022-04-15 11:31:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154248959] [2022-04-15 11:31:21,959 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash -391559510, now seen corresponding path program 2 times [2022-04-15 11:31:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:21,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090284349] [2022-04-15 11:31:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:22,244 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-15 11:31:22,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-15 11:31:22,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2770#true} {2770#true} #592#return; {2770#true} is VALID [2022-04-15 11:31:22,246 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-15 11:31:22,246 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-15 11:31:22,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-15 11:31:22,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #592#return; {2770#true} is VALID [2022-04-15 11:31:22,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret159 := main(); {2770#true} is VALID [2022-04-15 11:31:22,247 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-15 11:31:22,247 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-15 11:31:22,247 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-15 11:31:22,247 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-15 11:31:22,247 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-15 11:31:22,248 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-15 11:31:22,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-15 11:31:22,248 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-15 11:31:22,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#true} assume 12292 == #t~mem43;havoc #t~mem43; {2770#true} is VALID [2022-04-15 11:31:22,248 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-15 11:31:22,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {2770#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2770#true} is VALID [2022-04-15 11:31:22,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {2770#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2770#true} is VALID [2022-04-15 11:31:22,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {2770#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2770#true} is VALID [2022-04-15 11:31:22,249 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-15 11:31:22,251 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-15 11:31:22,251 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-15 11:31:22,251 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-15 11:31:22,254 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-15 11:31:22,254 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-15 11:31:22,254 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-15 11:31:22,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {2770#true} ~skip~0 := 0; {2770#true} is VALID [2022-04-15 11:31:22,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-15 11:31:22,256 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-15 11:31:22,256 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-15 11:31:22,256 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-15 11:31:22,257 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-15 11:31:22,257 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-15 11:31:22,265 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-15 11:31:22,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {2770#true} assume 4368 == #t~mem48;havoc #t~mem48; {2770#true} is VALID [2022-04-15 11:31:22,266 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-15 11:31:22,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {2770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2770#true} is VALID [2022-04-15 11:31:22,270 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-15 11:31:22,271 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-15 11:31:22,272 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-15 11:31:22,272 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-15 11:31:22,272 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-15 11:31:22,273 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-15 11:31:22,274 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-15 11:31:22,274 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-15 11:31:22,275 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-15 11:31:22,275 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-15 11:31:22,276 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-15 11:31:22,276 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-15 11:31:22,277 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-15 11:31:22,277 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-15 11:31:22,277 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-15 11:31:22,278 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-15 11:31:22,278 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-15 11:31:22,278 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-15 11:31:22,278 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-15 11:31:22,278 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-15 11:31:22,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {2771#false} assume 4432 == #t~mem56;havoc #t~mem56; {2771#false} is VALID [2022-04-15 11:31:22,278 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-15 11:31:22,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {2771#false} assume 5 == ~blastFlag~0; {2771#false} is VALID [2022-04-15 11:31:22,279 INFO L290 TraceCheckUtils]: 59: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2022-04-15 11:31:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090284349] [2022-04-15 11:31:22,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090284349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:22,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:22,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:22,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154248959] [2022-04-15 11:31:22,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154248959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:22,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:22,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812209879] [2022-04-15 11:31:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 11:31:22,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:22,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:22,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:22,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:22,356 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-15 11:31:24,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:25,564 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-04-15 11:31:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:25,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 11:31:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-15 11:31:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-15 11:31:25,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-15 11:31:25,870 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-15 11:31:25,875 INFO L225 Difference]: With dead ends: 368 [2022-04-15 11:31:25,875 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 11:31:25,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:25,877 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:25,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:31:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 11:31:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-04-15 11:31:25,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:25,901 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-15 11:31:25,902 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-15 11:31:25,902 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-15 11:31:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:25,910 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-15 11:31:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-15 11:31:25,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:25,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:25,912 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-15 11:31:25,913 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-15 11:31:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:25,922 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-15 11:31:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-15 11:31:25,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:25,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:25,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:25,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:25,924 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-15 11:31:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-04-15 11:31:25,932 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-04-15 11:31:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:25,932 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-04-15 11:31:25,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:25,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 360 transitions. [2022-04-15 11:31:26,214 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-15 11:31:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-04-15 11:31:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:31:26,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:26,216 INFO L499 BasicCegarLoop]: 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-15 11:31:26,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:31:26,217 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -63404668, now seen corresponding path program 3 times [2022-04-15 11:31:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385958354] [2022-04-15 11:31:38,445 WARN L232 SmtUtils]: Spent 12.22s 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-15 11:31:48,051 WARN L232 SmtUtils]: Spent 6.09s 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-15 11:31:48,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:31:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -63404668, now seen corresponding path program 4 times [2022-04-15 11:31:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:48,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100062765] [2022-04-15 11:31:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:49,068 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-15 11:31:49,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-15 11:31:49,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4528#true} {4528#true} #592#return; {4528#true} is VALID [2022-04-15 11:31:49,069 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-15 11:31:49,069 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-15 11:31:49,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-15 11:31:49,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4528#true} {4528#true} #592#return; {4528#true} is VALID [2022-04-15 11:31:49,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {4528#true} call #t~ret159 := main(); {4528#true} is VALID [2022-04-15 11:31:49,070 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-15 11:31:49,070 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-15 11:31:49,070 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-15 11:31:49,070 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-15 11:31:49,070 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-15 11:31:49,070 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-15 11:31:49,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-15 11:31:49,071 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-15 11:31:49,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {4528#true} assume 12292 == #t~mem43;havoc #t~mem43; {4528#true} is VALID [2022-04-15 11:31:49,071 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-15 11:31:49,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {4528#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4528#true} is VALID [2022-04-15 11:31:49,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {4528#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4528#true} is VALID [2022-04-15 11:31:49,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {4528#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4528#true} is VALID [2022-04-15 11:31:49,071 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-15 11:31:49,072 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-15 11:31:49,072 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-15 11:31:49,073 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-15 11:31:49,073 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-15 11:31:49,073 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-15 11:31:49,073 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-15 11:31:49,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {4528#true} ~skip~0 := 0; {4528#true} is VALID [2022-04-15 11:31:49,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-15 11:31:49,074 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-15 11:31:49,074 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-15 11:31:49,074 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-15 11:31:49,074 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-15 11:31:49,074 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-15 11:31:49,074 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-15 11:31:49,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#true} assume 4368 == #t~mem48;havoc #t~mem48; {4528#true} is VALID [2022-04-15 11:31:49,074 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-15 11:31:49,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {4528#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4528#true} is VALID [2022-04-15 11:31:49,076 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-15 11:31:49,076 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-15 11:31:49,077 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-15 11:31:49,077 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-15 11:31:49,078 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-15 11:31:49,078 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-15 11:31:49,078 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-15 11:31:49,080 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-15 11:31:49,080 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-15 11:31:49,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {4529#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4529#false} is VALID [2022-04-15 11:31:49,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {4529#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4529#false} is VALID [2022-04-15 11:31:49,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {4529#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4529#false} is VALID [2022-04-15 11:31:49,081 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-15 11:31:49,081 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-15 11:31:49,081 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-15 11:31:49,081 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-15 11:31:49,081 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-15 11:31:49,081 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-15 11:31:49,085 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-15 11:31:49,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {4529#false} ~skip~0 := 0; {4529#false} is VALID [2022-04-15 11:31:49,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-15 11:31:49,086 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-15 11:31:49,086 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-15 11:31:49,086 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-15 11:31:49,086 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-15 11:31:49,086 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-15 11:31:49,086 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-15 11:31:49,107 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-15 11:31:49,108 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-15 11:31:49,108 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-15 11:31:49,108 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-15 11:31:49,108 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-15 11:31:49,108 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-15 11:31:49,108 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-15 11:31:49,108 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-15 11:31:49,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {4529#false} assume 4432 == #t~mem56;havoc #t~mem56; {4529#false} is VALID [2022-04-15 11:31:49,109 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-15 11:31:49,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {4529#false} assume 5 == ~blastFlag~0; {4529#false} is VALID [2022-04-15 11:31:49,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-15 11:31:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:31:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:49,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100062765] [2022-04-15 11:31:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100062765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:49,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385958354] [2022-04-15 11:31:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385958354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:31:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058849869] [2022-04-15 11:31:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:31:49,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:49,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:49,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:49,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:31:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:31:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:31:49,186 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-15 11:31:51,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:52,459 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2022-04-15 11:31:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:31:52,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:31:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 11:31:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 11:31:52,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-15 11:31:52,844 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-15 11:31:52,857 INFO L225 Difference]: With dead ends: 655 [2022-04-15 11:31:52,857 INFO L226 Difference]: Without dead ends: 427 [2022-04-15 11:31:52,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:31:52,859 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:52,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 11:31:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-15 11:31:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 266. [2022-04-15 11:31:52,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:52,882 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-15 11:31:52,883 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-15 11:31:52,883 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-15 11:31:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:52,897 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-15 11:31:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-15 11:31:52,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:52,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:52,899 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-15 11:31:52,900 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-15 11:31:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:52,914 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-15 11:31:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-15 11:31:52,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:52,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:52,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:52,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:52,916 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-15 11:31:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2022-04-15 11:31:52,923 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 75 [2022-04-15 11:31:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:52,923 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2022-04-15 11:31:52,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:31:52,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 391 transitions. [2022-04-15 11:31:53,233 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-15 11:31:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2022-04-15 11:31:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:31:53,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:53,235 INFO L499 BasicCegarLoop]: 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-15 11:31:53,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:31:53,235 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:53,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash -82060126, now seen corresponding path program 1 times [2022-04-15 11:31:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:53,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161857099] [2022-04-15 11:32:19,777 WARN L232 SmtUtils]: Spent 21.19s 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-15 11:32:30,610 WARN L232 SmtUtils]: Spent 6.14s 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-15 11:32:31,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -82060126, now seen corresponding path program 2 times [2022-04-15 11:32:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:31,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368591972] [2022-04-15 11:32:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:31,713 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-15 11:32:31,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-15 11:32:31,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7236#true} {7236#true} #592#return; {7236#true} is VALID [2022-04-15 11:32:31,715 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-15 11:32:31,715 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-15 11:32:31,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-15 11:32:31,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7236#true} {7236#true} #592#return; {7236#true} is VALID [2022-04-15 11:32:31,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {7236#true} call #t~ret159 := main(); {7236#true} is VALID [2022-04-15 11:32:31,716 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-15 11:32:31,716 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-15 11:32:31,716 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-15 11:32:31,716 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-15 11:32:31,716 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-15 11:32:31,716 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-15 11:32:31,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-15 11:32:31,716 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-15 11:32:31,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {7236#true} assume 12292 == #t~mem43;havoc #t~mem43; {7236#true} is VALID [2022-04-15 11:32:31,721 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-15 11:32:31,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {7236#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7236#true} is VALID [2022-04-15 11:32:31,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {7236#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7236#true} is VALID [2022-04-15 11:32:31,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {7236#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7236#true} is VALID [2022-04-15 11:32:31,726 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-15 11:32:31,727 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-15 11:32:31,727 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-15 11:32:31,727 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-15 11:32:31,727 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-15 11:32:31,728 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-15 11:32:31,728 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-15 11:32:31,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {7236#true} ~skip~0 := 0; {7236#true} is VALID [2022-04-15 11:32:31,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-15 11:32:31,728 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-15 11:32:31,728 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-15 11:32:31,728 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-15 11:32:31,728 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-15 11:32:31,728 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-15 11:32:31,728 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-15 11:32:31,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {7236#true} assume 4368 == #t~mem48;havoc #t~mem48; {7236#true} is VALID [2022-04-15 11:32:31,729 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-15 11:32:31,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {7236#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7236#true} is VALID [2022-04-15 11:32:31,731 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-15 11:32:31,731 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-15 11:32:31,732 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-15 11:32:31,732 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-15 11:32:31,732 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-15 11:32:31,733 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-15 11:32:31,733 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-15 11:32:31,734 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-15 11:32:31,734 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-15 11:32:31,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {7237#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7237#false} is VALID [2022-04-15 11:32:31,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {7237#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7237#false} is VALID [2022-04-15 11:32:31,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {7237#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7237#false} is VALID [2022-04-15 11:32:31,735 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-15 11:32:31,735 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-15 11:32:31,735 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-15 11:32:31,736 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-15 11:32:31,736 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-15 11:32:31,736 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-15 11:32:31,736 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-15 11:32:31,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {7237#false} ~skip~0 := 0; {7237#false} is VALID [2022-04-15 11:32:31,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-15 11:32:31,736 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-15 11:32:31,736 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,737 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-15 11:32:31,738 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-15 11:32:31,738 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-15 11:32:31,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {7237#false} assume 4432 == #t~mem56;havoc #t~mem56; {7237#false} is VALID [2022-04-15 11:32:31,738 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-15 11:32:31,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {7237#false} assume 5 == ~blastFlag~0; {7237#false} is VALID [2022-04-15 11:32:31,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-15 11:32:31,740 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-15 11:32:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368591972] [2022-04-15 11:32:31,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368591972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:31,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:31,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:31,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161857099] [2022-04-15 11:32:31,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161857099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:31,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:31,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248970168] [2022-04-15 11:32:31,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:32:31,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:31,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:31,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:31,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:31,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:31,811 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-15 11:32:33,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:34,918 INFO L93 Difference]: Finished difference Result 678 states and 1005 transitions. [2022-04-15 11:32:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 11:32:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:32:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:32:34,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 11:32:35,335 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-15 11:32:35,349 INFO L225 Difference]: With dead ends: 678 [2022-04-15 11:32:35,349 INFO L226 Difference]: Without dead ends: 428 [2022-04-15 11:32:35,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:35,355 INFO L913 BasicCegarLoop]: 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-15 11:32:35,355 INFO L914 BasicCegarLoop]: 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-15 11:32:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-15 11:32:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2022-04-15 11:32:35,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:35,378 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-15 11:32:35,379 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-15 11:32:35,379 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-15 11:32:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:35,393 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-15 11:32:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-15 11:32:35,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:35,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:35,395 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-15 11:32:35,395 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-15 11:32:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:35,409 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-15 11:32:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-15 11:32:35,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:35,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:35,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:35,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:35,410 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-15 11:32:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-04-15 11:32:35,418 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 75 [2022-04-15 11:32:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:35,418 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-04-15 11:32:35,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:35,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 392 transitions. [2022-04-15 11:32:35,763 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-15 11:32:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-04-15 11:32:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:32:35,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:35,764 INFO L499 BasicCegarLoop]: 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-15 11:32:35,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:32:35,764 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2070296643, now seen corresponding path program 1 times [2022-04-15 11:32:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:35,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127145896] [2022-04-15 11:32:41,047 WARN L232 SmtUtils]: Spent 5.27s 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-15 11:32:52,649 WARN L232 SmtUtils]: Spent 10.28s 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-15 11:33:02,930 WARN L232 SmtUtils]: Spent 6.31s 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-15 11:33:03,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2070296643, now seen corresponding path program 2 times [2022-04-15 11:33:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:03,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823693332] [2022-04-15 11:33:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:03,974 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-15 11:33:03,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-15 11:33:03,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9996#true} {9996#true} #592#return; {9996#true} is VALID [2022-04-15 11:33:03,975 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-15 11:33:03,977 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-15 11:33:03,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-15 11:33:03,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9996#true} {9996#true} #592#return; {9996#true} is VALID [2022-04-15 11:33:03,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {9996#true} call #t~ret159 := main(); {9996#true} is VALID [2022-04-15 11:33:03,977 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-15 11:33:03,977 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-15 11:33:03,977 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-15 11:33:03,978 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-15 11:33:03,978 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-15 11:33:03,978 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-15 11:33:03,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-15 11:33:03,978 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-15 11:33:03,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {9996#true} assume 12292 == #t~mem43;havoc #t~mem43; {9996#true} is VALID [2022-04-15 11:33:03,978 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-15 11:33:03,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9996#true} is VALID [2022-04-15 11:33:03,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {9996#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9996#true} is VALID [2022-04-15 11:33:03,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {9996#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9996#true} is VALID [2022-04-15 11:33:03,978 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-15 11:33:03,979 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-15 11:33:03,979 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-15 11:33:03,979 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-15 11:33:03,979 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-15 11:33:03,979 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-15 11:33:03,979 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-15 11:33:03,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {9996#true} ~skip~0 := 0; {9996#true} is VALID [2022-04-15 11:33:03,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-15 11:33:03,979 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-15 11:33:03,979 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-15 11:33:03,980 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-15 11:33:03,980 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-15 11:33:03,980 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-15 11:33:03,980 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-15 11:33:03,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {9996#true} assume 4368 == #t~mem48;havoc #t~mem48; {9996#true} is VALID [2022-04-15 11:33:03,985 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-15 11:33:03,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {9996#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9996#true} is VALID [2022-04-15 11:33:03,987 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-15 11:33:03,987 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-15 11:33:03,987 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-15 11:33:03,988 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-15 11:33:03,988 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-15 11:33:03,989 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-15 11:33:03,989 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-15 11:33:03,989 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-15 11:33:03,990 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-15 11:33:03,990 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-15 11:33:03,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {9997#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9997#false} is VALID [2022-04-15 11:33:03,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {9997#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9997#false} is VALID [2022-04-15 11:33:03,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {9997#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9997#false} is VALID [2022-04-15 11:33:03,991 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-15 11:33:03,991 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-15 11:33:03,991 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-15 11:33:03,991 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-15 11:33:03,991 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-15 11:33:03,991 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-15 11:33:03,991 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-15 11:33:03,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {9997#false} ~skip~0 := 0; {9997#false} is VALID [2022-04-15 11:33:03,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-15 11:33:03,992 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-15 11:33:03,992 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-15 11:33:03,992 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-15 11:33:03,992 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-15 11:33:03,992 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-15 11:33:03,993 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-15 11:33:03,993 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-15 11:33:03,994 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-15 11:33:03,994 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-15 11:33:03,996 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-15 11:33:03,997 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-15 11:33:03,997 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-15 11:33:03,997 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-15 11:33:03,997 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-15 11:33:03,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {9997#false} assume 4432 == #t~mem56;havoc #t~mem56; {9997#false} is VALID [2022-04-15 11:33:03,997 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-15 11:33:03,998 INFO L290 TraceCheckUtils]: 74: Hoare triple {9997#false} assume 5 == ~blastFlag~0; {9997#false} is VALID [2022-04-15 11:33:03,998 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-15 11:33:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:03,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:03,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823693332] [2022-04-15 11:33:03,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823693332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:03,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:03,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:04,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:04,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127145896] [2022-04-15 11:33:04,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127145896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:04,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:04,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:04,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616603309] [2022-04-15 11:33:04,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 11:33:04,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:04,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:04,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:04,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:04,071 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-15 11:33:06,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:07,165 INFO L93 Difference]: Finished difference Result 421 states and 618 transitions. [2022-04-15 11:33:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:07,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 11:33:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:33:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:33:07,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-15 11:33:07,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:07,500 INFO L225 Difference]: With dead ends: 421 [2022-04-15 11:33:07,500 INFO L226 Difference]: Without dead ends: 284 [2022-04-15 11:33:07,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:07,501 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:07,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:33:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-15 11:33:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-15 11:33:07,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:07,513 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-15 11:33:07,514 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-15 11:33:07,514 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-15 11:33:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:07,521 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-15 11:33:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-15 11:33:07,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:07,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:07,522 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-15 11:33:07,523 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-15 11:33:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:07,529 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-15 11:33:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-15 11:33:07,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:07,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:07,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:07,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:07,531 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-15 11:33:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 391 transitions. [2022-04-15 11:33:07,538 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 391 transitions. Word has length 76 [2022-04-15 11:33:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:07,538 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 391 transitions. [2022-04-15 11:33:07,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:33:07,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 391 transitions. [2022-04-15 11:33:07,909 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-15 11:33:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 391 transitions. [2022-04-15 11:33:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:33:07,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:07,910 INFO L499 BasicCegarLoop]: 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-15 11:33:07,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:33:07,910 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1822086841, now seen corresponding path program 1 times [2022-04-15 11:33:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:07,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952169214] [2022-04-15 11:33:27,633 WARN L232 SmtUtils]: Spent 14.26s 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-15 11:33:37,932 WARN L232 SmtUtils]: Spent 6.55s 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-15 11:33:38,761 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1822086841, now seen corresponding path program 2 times [2022-04-15 11:33:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:38,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470416629] [2022-04-15 11:33:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:38,993 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-15 11:33:38,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-15 11:33:38,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11954#true} {11954#true} #592#return; {11954#true} is VALID [2022-04-15 11:33:38,996 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-15 11:33:38,996 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-15 11:33:38,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-15 11:33:38,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11954#true} {11954#true} #592#return; {11954#true} is VALID [2022-04-15 11:33:38,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {11954#true} call #t~ret159 := main(); {11954#true} is VALID [2022-04-15 11:33:38,996 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-15 11:33:38,996 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-15 11:33:38,996 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-15 11:33:38,996 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-15 11:33:38,997 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-15 11:33:38,997 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-15 11:33:38,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-15 11:33:38,997 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-15 11:33:38,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {11954#true} assume 12292 == #t~mem43;havoc #t~mem43; {11954#true} is VALID [2022-04-15 11:33:38,997 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-15 11:33:38,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11954#true} is VALID [2022-04-15 11:33:38,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {11954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11954#true} is VALID [2022-04-15 11:33:38,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {11954#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11954#true} is VALID [2022-04-15 11:33:38,997 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-15 11:33:38,997 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {11954#true} ~skip~0 := 0; {11954#true} is VALID [2022-04-15 11:33:38,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,998 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-15 11:33:38,999 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-15 11:33:38,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {11954#true} assume 4368 == #t~mem48;havoc #t~mem48; {11954#true} is VALID [2022-04-15 11:33:38,999 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-15 11:33:38,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {11954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11954#true} is VALID [2022-04-15 11:33:39,004 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-15 11:33:39,005 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-15 11:33:39,005 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-15 11:33:39,005 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-15 11:33:39,006 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-15 11:33:39,006 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-15 11:33:39,007 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-15 11:33:39,007 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-15 11:33:39,007 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-15 11:33:39,008 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-15 11:33:39,008 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-15 11:33:39,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {11955#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11955#false} is VALID [2022-04-15 11:33:39,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {11955#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11955#false} is VALID [2022-04-15 11:33:39,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {11955#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11955#false} is VALID [2022-04-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {11955#false} ~skip~0 := 0; {11955#false} is VALID [2022-04-15 11:33:39,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-15 11:33:39,009 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-15 11:33:39,009 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 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-15 11:33:39,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {11955#false} assume 4432 == #t~mem56;havoc #t~mem56; {11955#false} is VALID [2022-04-15 11:33:39,011 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-15 11:33:39,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {11955#false} assume 5 == ~blastFlag~0; {11955#false} is VALID [2022-04-15 11:33:39,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-15 11:33:39,012 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-15 11:33:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470416629] [2022-04-15 11:33:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470416629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:39,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:39,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:39,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952169214] [2022-04-15 11:33:39,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952169214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:39,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:39,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262379134] [2022-04-15 11:33:39,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:39,014 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-15 11:33:39,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:39,015 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-15 11:33:39,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:39,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:39,090 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-15 11:33:41,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:42,191 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2022-04-15 11:33:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:42,192 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-15 11:33:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:42,192 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-15 11:33:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-15 11:33:42,195 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-15 11:33:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-15 11:33:42,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 385 transitions. [2022-04-15 11:33:42,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:42,519 INFO L225 Difference]: With dead ends: 421 [2022-04-15 11:33:42,519 INFO L226 Difference]: Without dead ends: 284 [2022-04-15 11:33:42,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:42,520 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:42,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:33:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-15 11:33:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-15 11:33:42,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:42,532 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-15 11:33:42,533 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-15 11:33:42,533 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-15 11:33:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:42,539 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-15 11:33:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-15 11:33:42,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:42,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:42,557 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-15 11:33:42,558 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-15 11:33:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:42,567 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-15 11:33:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-15 11:33:42,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:42,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:42,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:42,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:42,568 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-15 11:33:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2022-04-15 11:33:42,576 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 77 [2022-04-15 11:33:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:42,576 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2022-04-15 11:33:42,577 INFO L479 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-15 11:33:42,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 390 transitions. [2022-04-15 11:33:42,909 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-15 11:33:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2022-04-15 11:33:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:33:42,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:42,910 INFO L499 BasicCegarLoop]: 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-15 11:33:42,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:33:42,911 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash -963517886, now seen corresponding path program 1 times [2022-04-15 11:33:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:42,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61244592] [2022-04-15 11:33:57,630 WARN L232 SmtUtils]: Spent 8.90s 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-15 11:34:09,716 WARN L232 SmtUtils]: Spent 7.68s 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-15 11:34:10,557 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash -963517886, now seen corresponding path program 2 times [2022-04-15 11:34:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:10,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962835059] [2022-04-15 11:34:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:10,741 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-15 11:34:10,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-15 11:34:10,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13912#true} {13912#true} #592#return; {13912#true} is VALID [2022-04-15 11:34:10,742 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-15 11:34:10,743 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-15 11:34:10,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-15 11:34:10,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13912#true} {13912#true} #592#return; {13912#true} is VALID [2022-04-15 11:34:10,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {13912#true} call #t~ret159 := main(); {13912#true} is VALID [2022-04-15 11:34:10,743 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-15 11:34:10,743 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-15 11:34:10,743 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-15 11:34:10,743 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-15 11:34:10,743 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-15 11:34:10,743 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-15 11:34:10,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-15 11:34:10,744 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-15 11:34:10,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {13912#true} assume 12292 == #t~mem43;havoc #t~mem43; {13912#true} is VALID [2022-04-15 11:34:10,744 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-15 11:34:10,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {13912#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13912#true} is VALID [2022-04-15 11:34:10,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {13912#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13912#true} is VALID [2022-04-15 11:34:10,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {13912#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13912#true} is VALID [2022-04-15 11:34:10,744 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-15 11:34:10,744 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-15 11:34:10,744 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-15 11:34:10,744 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-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {13912#true} ~skip~0 := 0; {13912#true} is VALID [2022-04-15 11:34:10,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 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-15 11:34:10,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {13912#true} assume 4368 == #t~mem48;havoc #t~mem48; {13912#true} is VALID [2022-04-15 11:34:10,746 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-15 11:34:10,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {13912#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13912#true} is VALID [2022-04-15 11:34:10,747 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-15 11:34:10,747 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-15 11:34:10,748 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-15 11:34:10,748 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-15 11:34:10,749 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-15 11:34:10,749 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-15 11:34:10,749 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-15 11:34:10,750 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-15 11:34:10,750 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-15 11:34:10,751 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-15 11:34:10,751 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-15 11:34:10,751 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-15 11:34:10,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {13913#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13913#false} is VALID [2022-04-15 11:34:10,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {13913#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13913#false} is VALID [2022-04-15 11:34:10,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {13913#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13913#false} is VALID [2022-04-15 11:34:10,752 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-15 11:34:10,752 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-15 11:34:10,752 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-15 11:34:10,752 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-15 11:34:10,752 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-15 11:34:10,752 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-15 11:34:10,752 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-15 11:34:10,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#false} ~skip~0 := 0; {13913#false} is VALID [2022-04-15 11:34:10,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,753 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-15 11:34:10,754 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-15 11:34:10,754 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-15 11:34:10,754 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-15 11:34:10,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {13913#false} assume 4432 == #t~mem56;havoc #t~mem56; {13913#false} is VALID [2022-04-15 11:34:10,754 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-15 11:34:10,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {13913#false} assume 5 == ~blastFlag~0; {13913#false} is VALID [2022-04-15 11:34:10,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-15 11:34:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:10,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962835059] [2022-04-15 11:34:10,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962835059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:10,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:10,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:10,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:10,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61244592] [2022-04-15 11:34:10,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61244592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:10,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:10,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275687474] [2022-04-15 11:34:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:10,756 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-15 11:34:10,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:10,756 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-15 11:34:10,825 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-15 11:34:10,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:10,826 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-15 11:34:12,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:13,820 INFO L93 Difference]: Finished difference Result 412 states and 603 transitions. [2022-04-15 11:34:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:13,820 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-15 11:34:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:13,820 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-15 11:34:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-15 11:34:13,823 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-15 11:34:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-15 11:34:13,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 373 transitions. [2022-04-15 11:34:14,097 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-15 11:34:14,103 INFO L225 Difference]: With dead ends: 412 [2022-04-15 11:34:14,103 INFO L226 Difference]: Without dead ends: 275 [2022-04-15 11:34:14,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:14,104 INFO L913 BasicCegarLoop]: 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-15 11:34:14,105 INFO L914 BasicCegarLoop]: 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-15 11:34:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-15 11:34:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-04-15 11:34:14,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:14,122 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-15 11:34:14,125 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-15 11:34:14,126 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-15 11:34:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,132 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-15 11:34:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-15 11:34:14,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:14,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:14,133 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-15 11:34:14,134 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-15 11:34:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:14,140 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-15 11:34:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-15 11:34:14,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:14,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:14,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:14,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:14,155 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-15 11:34:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 389 transitions. [2022-04-15 11:34:14,162 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 389 transitions. Word has length 78 [2022-04-15 11:34:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:14,163 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 389 transitions. [2022-04-15 11:34:14,164 INFO L479 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-15 11:34:14,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 389 transitions. [2022-04-15 11:34:14,540 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-15 11:34:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 389 transitions. [2022-04-15 11:34:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:34:14,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:14,542 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:14,542 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:34:14,542 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -867420063, now seen corresponding path program 1 times [2022-04-15 11:34:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:14,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1060106321] [2022-04-15 11:34:14,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -867420063, now seen corresponding path program 2 times [2022-04-15 11:34:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:14,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126926487] [2022-04-15 11:34:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:14,748 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-15 11:34:14,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-15 11:34:14,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15834#true} {15834#true} #592#return; {15834#true} is VALID [2022-04-15 11:34:14,749 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-15 11:34:14,749 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-15 11:34:14,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-15 11:34:14,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15834#true} {15834#true} #592#return; {15834#true} is VALID [2022-04-15 11:34:14,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {15834#true} call #t~ret159 := main(); {15834#true} is VALID [2022-04-15 11:34:14,750 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-15 11:34:14,750 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-15 11:34:14,750 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-15 11:34:14,750 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-15 11:34:14,750 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-15 11:34:14,750 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-15 11:34:14,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-15 11:34:14,751 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-15 11:34:14,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {15834#true} assume 12292 == #t~mem43;havoc #t~mem43; {15834#true} is VALID [2022-04-15 11:34:14,751 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-15 11:34:14,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {15834#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15834#true} is VALID [2022-04-15 11:34:14,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {15834#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15834#true} is VALID [2022-04-15 11:34:14,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {15834#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {15834#true} is VALID [2022-04-15 11:34:14,751 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-15 11:34:14,751 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-15 11:34:14,751 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-15 11:34:14,751 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-15 11:34:14,751 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-15 11:34:14,751 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-15 11:34:14,751 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-15 11:34:14,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-15 11:34:14,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-15 11:34:14,752 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-15 11:34:14,752 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-15 11:34:14,752 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-15 11:34:14,752 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-15 11:34:14,752 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-15 11:34:14,752 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-15 11:34:14,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {15834#true} assume 4368 == #t~mem48;havoc #t~mem48; {15834#true} is VALID [2022-04-15 11:34:14,752 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-15 11:34:14,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {15834#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15834#true} is VALID [2022-04-15 11:34:14,752 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-15 11:34:14,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,753 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-15 11:34:14,754 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-15 11:34:14,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {15834#true} assume 4384 == #t~mem50;havoc #t~mem50; {15834#true} is VALID [2022-04-15 11:34:14,754 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-15 11:34:14,754 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-15 11:34:14,754 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-15 11:34:14,755 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-15 11:34:14,755 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-15 11:34:14,755 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-15 11:34:14,756 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-15 11:34:14,756 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-15 11:34:14,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:14,757 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-15 11:34:14,757 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-15 11:34:14,757 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-15 11:34:14,757 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-15 11:34:14,758 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-15 11:34:14,758 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-15 11:34:14,758 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-15 11:34:14,759 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-15 11:34:14,759 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-15 11:34:14,759 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-15 11:34:14,760 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-15 11:34:14,760 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-15 11:34:14,760 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-15 11:34:14,760 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-15 11:34:14,761 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-15 11:34:14,761 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-15 11:34:14,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15835#false} is VALID [2022-04-15 11:34:14,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {15835#false} assume !false; {15835#false} is VALID [2022-04-15 11:34:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 11:34:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126926487] [2022-04-15 11:34:14,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126926487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:14,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:14,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:14,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1060106321] [2022-04-15 11:34:14,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1060106321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:14,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:14,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007864824] [2022-04-15 11:34:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:14,763 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-15 11:34:14,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:14,764 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-15 11:34:14,824 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-15 11:34:14,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:14,826 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-15 11:34:16,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:17,951 INFO L93 Difference]: Finished difference Result 539 states and 791 transitions. [2022-04-15 11:34:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:17,951 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-15 11:34:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:17,952 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-15 11:34:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-15 11:34:17,956 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-15 11:34:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-15 11:34:17,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-15 11:34:18,376 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-15 11:34:18,387 INFO L225 Difference]: With dead ends: 539 [2022-04-15 11:34:18,387 INFO L226 Difference]: Without dead ends: 402 [2022-04-15 11:34:18,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:18,390 INFO L913 BasicCegarLoop]: 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-15 11:34:18,390 INFO L914 BasicCegarLoop]: 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-15 11:34:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-15 11:34:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2022-04-15 11:34:18,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:18,404 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-15 11:34:18,405 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-15 11:34:18,405 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-15 11:34:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,416 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-15 11:34:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-15 11:34:18,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:18,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:18,418 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-15 11:34:18,418 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-15 11:34:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:18,429 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-15 11:34:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-15 11:34:18,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:18,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:18,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:18,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:18,431 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-15 11:34:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 583 transitions. [2022-04-15 11:34:18,445 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 583 transitions. Word has length 78 [2022-04-15 11:34:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:18,445 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 583 transitions. [2022-04-15 11:34:18,446 INFO L479 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-15 11:34:18,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 402 states and 583 transitions. [2022-04-15 11:34:18,914 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-15 11:34:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-15 11:34:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:34:18,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:18,915 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:18,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:34:18,916 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -805380449, now seen corresponding path program 1 times [2022-04-15 11:34:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1660392697] [2022-04-15 11:34:18,917 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash -805380449, now seen corresponding path program 2 times [2022-04-15 11:34:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731684736] [2022-04-15 11:34:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:19,082 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-15 11:34:19,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-15 11:34:19,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18529#true} {18529#true} #592#return; {18529#true} is VALID [2022-04-15 11:34:19,083 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-15 11:34:19,084 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-15 11:34:19,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-15 11:34:19,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18529#true} {18529#true} #592#return; {18529#true} is VALID [2022-04-15 11:34:19,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {18529#true} call #t~ret159 := main(); {18529#true} is VALID [2022-04-15 11:34:19,084 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-15 11:34:19,084 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-15 11:34:19,084 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-15 11:34:19,084 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-15 11:34:19,084 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-15 11:34:19,084 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-15 11:34:19,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-15 11:34:19,085 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-15 11:34:19,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {18529#true} assume 12292 == #t~mem43;havoc #t~mem43; {18529#true} is VALID [2022-04-15 11:34:19,085 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-15 11:34:19,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {18529#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18529#true} is VALID [2022-04-15 11:34:19,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {18529#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18529#true} is VALID [2022-04-15 11:34:19,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {18529#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {18529#true} is VALID [2022-04-15 11:34:19,085 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-15 11:34:19,085 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-15 11:34:19,085 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-15 11:34:19,085 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-15 11:34:19,085 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-15 11:34:19,085 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-15 11:34:19,086 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-15 11:34:19,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {18529#true} ~skip~0 := 0; {18529#true} is VALID [2022-04-15 11:34:19,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-15 11:34:19,086 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-15 11:34:19,086 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-15 11:34:19,086 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-15 11:34:19,086 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-15 11:34:19,086 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-15 11:34:19,086 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-15 11:34:19,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {18529#true} assume 4368 == #t~mem48;havoc #t~mem48; {18529#true} is VALID [2022-04-15 11:34:19,086 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-15 11:34:19,087 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-15 11:34:19,087 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-15 11:34:19,087 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-15 11:34:19,088 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-15 11:34:19,088 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-15 11:34:19,088 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-15 11:34:19,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:19,089 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-15 11:34:19,089 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-15 11:34:19,089 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-15 11:34:19,103 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-15 11:34:19,104 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-15 11:34:19,104 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-15 11:34:19,104 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-15 11:34:19,105 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-15 11:34:19,105 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-15 11:34:19,105 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-15 11:34:19,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18530#false} is VALID [2022-04-15 11:34:19,106 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-15 11:34:19,106 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-15 11:34:19,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {18530#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18530#false} is VALID [2022-04-15 11:34:19,106 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-15 11:34:19,106 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-15 11:34:19,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {18530#false} ~skip~0 := 0; {18530#false} is VALID [2022-04-15 11:34:19,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-15 11:34:19,106 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-15 11:34:19,106 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-15 11:34:19,106 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-15 11:34:19,106 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 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-15 11:34:19,107 INFO L290 TraceCheckUtils]: 74: Hoare triple {18530#false} assume 4432 == #t~mem56;havoc #t~mem56; {18530#false} is VALID [2022-04-15 11:34:19,107 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-15 11:34:19,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {18530#false} assume 5 == ~blastFlag~0; {18530#false} is VALID [2022-04-15 11:34:19,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-15 11:34:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:19,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731684736] [2022-04-15 11:34:19,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731684736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:19,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:19,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:19,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:19,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1660392697] [2022-04-15 11:34:19,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1660392697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:19,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:19,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176117236] [2022-04-15 11:34:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:19,110 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-15 11:34:19,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:19,110 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-15 11:34:19,178 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-15 11:34:19,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:19,179 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-15 11:34:21,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:21,980 INFO L93 Difference]: Finished difference Result 697 states and 1013 transitions. [2022-04-15 11:34:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:21,981 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-15 11:34:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:21,981 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-15 11:34:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-15 11:34:21,984 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-15 11:34:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-15 11:34:21,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-15 11:34:22,290 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-15 11:34:22,302 INFO L225 Difference]: With dead ends: 697 [2022-04-15 11:34:22,302 INFO L226 Difference]: Without dead ends: 426 [2022-04-15 11:34:22,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:22,304 INFO L913 BasicCegarLoop]: 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-15 11:34:22,305 INFO L914 BasicCegarLoop]: 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-15 11:34:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-04-15 11:34:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-04-15 11:34:22,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:22,322 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-15 11:34:22,322 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-15 11:34:22,324 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-15 11:34:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:22,337 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-15 11:34:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-15 11:34:22,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:22,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:22,340 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-15 11:34:22,341 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-15 11:34:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:22,354 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-15 11:34:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-15 11:34:22,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:22,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:22,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:22,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:22,356 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-15 11:34:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 615 transitions. [2022-04-15 11:34:22,372 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 615 transitions. Word has length 78 [2022-04-15 11:34:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:22,372 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 615 transitions. [2022-04-15 11:34:22,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:22,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 615 transitions. [2022-04-15 11:34:22,917 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-15 11:34:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-15 11:34:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 11:34:22,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:22,919 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:22,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:34:22,920 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1023132448, now seen corresponding path program 1 times [2022-04-15 11:34:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288652756] [2022-04-15 11:34:22,921 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1023132448, now seen corresponding path program 2 times [2022-04-15 11:34:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:22,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914546812] [2022-04-15 11:34:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:23,101 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-15 11:34:23,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 11:34:23,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #592#return; {21636#true} is VALID [2022-04-15 11:34:23,109 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-15 11:34:23,109 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-15 11:34:23,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 11:34:23,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #592#return; {21636#true} is VALID [2022-04-15 11:34:23,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret159 := main(); {21636#true} is VALID [2022-04-15 11:34:23,110 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-15 11:34:23,110 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-15 11:34:23,110 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-15 11:34:23,110 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-15 11:34:23,110 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-15 11:34:23,110 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-15 11:34:23,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:23,110 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-15 11:34:23,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {21636#true} assume 12292 == #t~mem43;havoc #t~mem43; {21636#true} is VALID [2022-04-15 11:34:23,110 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-15 11:34:23,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21636#true} is VALID [2022-04-15 11:34:23,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21636#true} is VALID [2022-04-15 11:34:23,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {21636#true} is VALID [2022-04-15 11:34:23,111 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-15 11:34:23,111 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-15 11:34:23,111 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-15 11:34:23,111 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-15 11:34:23,111 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-15 11:34:23,111 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-15 11:34:23,111 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-15 11:34:23,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-15 11:34:23,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:23,111 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-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {21636#true} assume 4368 == #t~mem48;havoc #t~mem48; {21636#true} is VALID [2022-04-15 11:34:23,112 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-15 11:34:23,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {21636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21636#true} is VALID [2022-04-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,112 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-15 11:34:23,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-15 11:34:23,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 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-15 11:34:23,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {21636#true} assume 4384 == #t~mem50;havoc #t~mem50; {21636#true} is VALID [2022-04-15 11:34:23,113 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-15 11:34:23,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {21636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21636#true} is VALID [2022-04-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {21636#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-15 11:34:23,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,114 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-15 11:34:23,115 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-15 11:34:23,115 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-15 11:34:23,115 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-15 11:34:23,115 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-15 11:34:23,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {21636#true} assume 4400 == #t~mem52;havoc #t~mem52; {21636#true} is VALID [2022-04-15 11:34:23,115 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-15 11:34:23,115 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-15 11:34:23,124 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-15 11:34:23,125 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-15 11:34:23,125 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-15 11:34:23,125 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-15 11:34:23,126 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-15 11:34:23,126 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-15 11:34:23,126 INFO L290 TraceCheckUtils]: 79: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:23,127 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-15 11:34:23,127 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-15 11:34:23,127 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-15 11:34:23,127 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-15 11:34:23,128 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-15 11:34:23,128 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-15 11:34:23,128 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-15 11:34:23,129 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-15 11:34:23,129 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-15 11:34:23,129 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-15 11:34:23,130 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-15 11:34:23,130 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-15 11:34:23,130 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-15 11:34:23,131 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-15 11:34:23,131 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-15 11:34:23,131 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-15 11:34:23,132 INFO L290 TraceCheckUtils]: 96: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21637#false} is VALID [2022-04-15 11:34:23,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-15 11:34:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:34:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:23,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914546812] [2022-04-15 11:34:23,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914546812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:23,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:23,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:23,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288652756] [2022-04-15 11:34:23,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288652756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:23,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:23,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358160427] [2022-04-15 11:34:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:23,134 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-15 11:34:23,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:23,134 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-15 11:34:23,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:23,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:23,202 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-15 11:34:25,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:26,227 INFO L93 Difference]: Finished difference Result 854 states and 1242 transitions. [2022-04-15 11:34:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:26,227 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-15 11:34:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:26,228 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-15 11:34:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-15 11:34:26,230 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-15 11:34:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-15 11:34:26,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-15 11:34:26,563 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-15 11:34:26,585 INFO L225 Difference]: With dead ends: 854 [2022-04-15 11:34:26,585 INFO L226 Difference]: Without dead ends: 559 [2022-04-15 11:34:26,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:26,587 INFO L913 BasicCegarLoop]: 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-15 11:34:26,587 INFO L914 BasicCegarLoop]: 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-15 11:34:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-15 11:34:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-04-15 11:34:26,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:26,609 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-15 11:34:26,610 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-15 11:34:26,611 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-15 11:34:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:26,627 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-15 11:34:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-15 11:34:26,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:26,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:26,630 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-15 11:34:26,631 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-15 11:34:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:26,664 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-15 11:34:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-15 11:34:26,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:26,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:26,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:26,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:26,667 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-15 11:34:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 808 transitions. [2022-04-15 11:34:26,690 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 808 transitions. Word has length 98 [2022-04-15 11:34:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:26,691 INFO L478 AbstractCegarLoop]: Abstraction has 559 states and 808 transitions. [2022-04-15 11:34:26,691 INFO L479 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-15 11:34:26,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 559 states and 808 transitions. [2022-04-15 11:34:27,318 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-15 11:34:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-15 11:34:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 11:34:27,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:27,320 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:27,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:34:27,320 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 1 times [2022-04-15 11:34:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:27,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321559288] [2022-04-15 11:34:27,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 2 times [2022-04-15 11:34:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:27,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747036149] [2022-04-15 11:34:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:27,520 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-15 11:34:27,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-15 11:34:27,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25589#true} {25589#true} #592#return; {25589#true} is VALID [2022-04-15 11:34:27,521 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-15 11:34:27,521 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-15 11:34:27,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-15 11:34:27,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25589#true} {25589#true} #592#return; {25589#true} is VALID [2022-04-15 11:34:27,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {25589#true} call #t~ret159 := main(); {25589#true} is VALID [2022-04-15 11:34:27,522 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-15 11:34:27,522 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-15 11:34:27,529 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-15 11:34:27,530 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-15 11:34:27,530 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-15 11:34:27,530 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-15 11:34:27,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:27,530 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-15 11:34:27,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#true} assume 12292 == #t~mem43;havoc #t~mem43; {25589#true} is VALID [2022-04-15 11:34:27,530 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-15 11:34:27,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25589#true} is VALID [2022-04-15 11:34:27,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25589#true} is VALID [2022-04-15 11:34:27,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {25589#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {25589#true} is VALID [2022-04-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:27,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,531 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-15 11:34:27,532 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-15 11:34:27,532 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-15 11:34:27,532 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-15 11:34:27,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {25589#true} assume 4368 == #t~mem48;havoc #t~mem48; {25589#true} is VALID [2022-04-15 11:34:27,532 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-15 11:34:27,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {25589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25589#true} is VALID [2022-04-15 11:34:27,532 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-15 11:34:27,532 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-15 11:34:27,532 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-15 11:34:27,532 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-15 11:34:27,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:27,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:27,532 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-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {25589#true} assume 4384 == #t~mem50;havoc #t~mem50; {25589#true} is VALID [2022-04-15 11:34:27,533 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-15 11:34:27,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {25589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25589#true} is VALID [2022-04-15 11:34:27,533 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-15 11:34:27,533 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-15 11:34:27,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {25589#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-15 11:34:27,534 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-15 11:34:27,534 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-15 11:34:27,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:27,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:27,534 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-15 11:34:27,534 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-15 11:34:27,534 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-15 11:34:27,534 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-15 11:34:27,534 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-15 11:34:27,552 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-15 11:34:27,552 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-15 11:34:27,552 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-15 11:34:27,552 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-15 11:34:27,552 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-15 11:34:27,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {25589#true} assume 4400 == #t~mem52;havoc #t~mem52; {25589#true} is VALID [2022-04-15 11:34:27,552 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-15 11:34:27,552 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-15 11:34:27,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {25589#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25589#true} is VALID [2022-04-15 11:34:27,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {25589#true} assume !(~ret~0 <= 0); {25589#true} is VALID [2022-04-15 11:34:27,553 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-15 11:34:27,553 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-15 11:34:27,553 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-15 11:34:27,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-15 11:34:27,553 INFO L290 TraceCheckUtils]: 79: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-15 11:34:27,553 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-15 11:34:27,553 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-15 11:34:27,553 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-15 11:34:27,553 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-15 11:34:27,553 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-15 11:34:27,554 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-15 11:34:27,554 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-15 11:34:27,554 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-15 11:34:27,554 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-15 11:34:27,554 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-15 11:34:27,554 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-15 11:34:27,554 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-15 11:34:27,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {25589#true} assume 4416 == #t~mem54;havoc #t~mem54; {25589#true} is VALID [2022-04-15 11:34:27,554 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-15 11:34:27,555 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-15 11:34:27,555 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-15 11:34:27,555 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-15 11:34:27,556 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-15 11:34:27,556 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-15 11:34:27,556 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-15 11:34:27,557 INFO L290 TraceCheckUtils]: 100: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:34:27,557 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-15 11:34:27,557 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-15 11:34:27,557 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-15 11:34:27,558 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-15 11:34:27,558 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-15 11:34:27,558 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-15 11:34:27,559 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-15 11:34:27,559 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-15 11:34:27,559 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-15 11:34:27,559 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-15 11:34:27,560 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-15 11:34:27,560 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-15 11:34:27,560 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-15 11:34:27,561 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-15 11:34:27,561 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-15 11:34:27,561 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-15 11:34:27,561 INFO L290 TraceCheckUtils]: 117: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25590#false} is VALID [2022-04-15 11:34:27,562 INFO L290 TraceCheckUtils]: 118: Hoare triple {25590#false} assume !false; {25590#false} is VALID [2022-04-15 11:34:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 11:34:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747036149] [2022-04-15 11:34:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747036149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:27,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321559288] [2022-04-15 11:34:27,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321559288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:27,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:27,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471200140] [2022-04-15 11:34:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:27,564 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-15 11:34:27,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:27,564 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-15 11:34:27,631 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-15 11:34:27,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:27,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:27,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:27,633 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-15 11:34:29,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:30,630 INFO L93 Difference]: Finished difference Result 1119 states and 1626 transitions. [2022-04-15 11:34:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:30,630 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-15 11:34:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:30,630 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-15 11:34:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-15 11:34:30,633 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-15 11:34:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-15 11:34:30,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-15 11:34:30,968 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-15 11:34:30,992 INFO L225 Difference]: With dead ends: 1119 [2022-04-15 11:34:30,992 INFO L226 Difference]: Without dead ends: 691 [2022-04-15 11:34:30,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:30,993 INFO L913 BasicCegarLoop]: 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-15 11:34:30,993 INFO L914 BasicCegarLoop]: 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-15 11:34:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-15 11:34:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-04-15 11:34:31,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:31,020 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-15 11:34:31,021 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-15 11:34:31,022 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-15 11:34:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:31,045 INFO L93 Difference]: Finished difference Result 691 states and 999 transitions. [2022-04-15 11:34:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-15 11:34:31,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:31,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:31,048 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-15 11:34:31,050 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-15 11:34:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:31,074 INFO L93 Difference]: Finished difference Result 691 states and 999 transitions. [2022-04-15 11:34:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-15 11:34:31,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:31,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:31,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:31,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:31,077 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-15 11:34:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 999 transitions. [2022-04-15 11:34:31,110 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 999 transitions. Word has length 119 [2022-04-15 11:34:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:31,110 INFO L478 AbstractCegarLoop]: Abstraction has 691 states and 999 transitions. [2022-04-15 11:34:31,110 INFO L479 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-15 11:34:31,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 999 transitions. [2022-04-15 11:34:31,917 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-15 11:34:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-15 11:34:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:34:31,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:31,919 INFO L499 BasicCegarLoop]: 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-15 11:34:31,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:34:31,919 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash 409023911, now seen corresponding path program 1 times [2022-04-15 11:34:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:31,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145334875] [2022-04-15 11:34:31,920 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 409023911, now seen corresponding path program 2 times [2022-04-15 11:34:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:31,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381851927] [2022-04-15 11:34:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:32,130 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-15 11:34:32,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {30600#true} assume true; {30600#true} is VALID [2022-04-15 11:34:32,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30600#true} {30600#true} #592#return; {30600#true} is VALID [2022-04-15 11:34:32,131 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-15 11:34:32,131 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-15 11:34:32,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {30600#true} assume true; {30600#true} is VALID [2022-04-15 11:34:32,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30600#true} {30600#true} #592#return; {30600#true} is VALID [2022-04-15 11:34:32,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {30600#true} call #t~ret159 := main(); {30600#true} is VALID [2022-04-15 11:34:32,132 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-15 11:34:32,132 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-15 11:34:32,132 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-15 11:34:32,132 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-15 11:34:32,132 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-15 11:34:32,132 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-15 11:34:32,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-15 11:34:32,133 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-15 11:34:32,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {30600#true} assume 12292 == #t~mem43;havoc #t~mem43; {30600#true} is VALID [2022-04-15 11:34:32,133 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-15 11:34:32,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {30600#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30600#true} is VALID [2022-04-15 11:34:32,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {30600#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30600#true} is VALID [2022-04-15 11:34:32,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {30600#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {30600#true} is VALID [2022-04-15 11:34:32,133 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-15 11:34:32,133 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-15 11:34:32,133 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-15 11:34:32,133 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-15 11:34:32,133 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-15 11:34:32,134 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-15 11:34:32,134 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-15 11:34:32,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {30600#true} ~skip~0 := 0; {30600#true} is VALID [2022-04-15 11:34:32,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-15 11:34:32,134 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-15 11:34:32,134 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-15 11:34:32,134 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-15 11:34:32,134 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-15 11:34:32,134 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-15 11:34:32,134 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-15 11:34:32,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {30600#true} assume 4368 == #t~mem48;havoc #t~mem48; {30600#true} is VALID [2022-04-15 11:34:32,134 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-15 11:34:32,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {30600#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30600#true} is VALID [2022-04-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {30600#true} ~skip~0 := 0; {30600#true} is VALID [2022-04-15 11:34:32,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,135 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-15 11:34:32,136 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-15 11:34:32,136 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-15 11:34:32,136 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-15 11:34:32,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {30600#true} assume 4384 == #t~mem50;havoc #t~mem50; {30600#true} is VALID [2022-04-15 11:34:32,136 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-15 11:34:32,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {30600#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30600#true} is VALID [2022-04-15 11:34:32,136 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-15 11:34:32,137 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-15 11:34:32,137 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-15 11:34:32,138 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-15 11:34:32,138 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-15 11:34:32,138 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-15 11:34:32,139 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-15 11:34:32,139 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-15 11:34:32,139 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-15 11:34:32,140 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-15 11:34:32,140 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-15 11:34:32,140 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-15 11:34:32,140 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-15 11:34:32,141 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-15 11:34:32,141 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-15 11:34:32,141 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-15 11:34:32,142 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-15 11:34:32,142 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-15 11:34:32,142 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-15 11:34:32,142 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-15 11:34:32,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {30601#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30601#false} is VALID [2022-04-15 11:34:32,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {30601#false} assume !(~ret~0 <= 0); {30601#false} is VALID [2022-04-15 11:34:32,142 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-15 11:34:32,142 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-15 11:34:32,143 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-15 11:34:32,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-15 11:34:32,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,143 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-15 11:34:32,144 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-15 11:34:32,144 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-15 11:34:32,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {30601#false} assume 4416 == #t~mem54;havoc #t~mem54; {30601#false} is VALID [2022-04-15 11:34:32,144 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-15 11:34:32,144 INFO L290 TraceCheckUtils]: 94: Hoare triple {30601#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30601#false} is VALID [2022-04-15 11:34:32,144 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-15 11:34:32,144 INFO L290 TraceCheckUtils]: 96: Hoare triple {30601#false} assume !(0 == ~tmp___6~0); {30601#false} is VALID [2022-04-15 11:34:32,144 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-15 11:34:32,144 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-15 11:34:32,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-15 11:34:32,144 INFO L290 TraceCheckUtils]: 100: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-15 11:34:32,144 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,145 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-15 11:34:32,146 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-15 11:34:32,146 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-15 11:34:32,146 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-15 11:34:32,146 INFO L290 TraceCheckUtils]: 117: Hoare triple {30601#false} assume 4448 == #t~mem58;havoc #t~mem58; {30601#false} is VALID [2022-04-15 11:34:32,146 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-15 11:34:32,146 INFO L290 TraceCheckUtils]: 119: Hoare triple {30601#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30601#false} is VALID [2022-04-15 11:34:32,146 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-15 11:34:32,146 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-15 11:34:32,146 INFO L290 TraceCheckUtils]: 122: Hoare triple {30601#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30601#false} is VALID [2022-04-15 11:34:32,146 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-15 11:34:32,147 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-15 11:34:32,147 INFO L290 TraceCheckUtils]: 125: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-15 11:34:32,147 INFO L290 TraceCheckUtils]: 126: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,147 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-15 11:34:32,148 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-15 11:34:32,148 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-15 11:34:32,148 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-15 11:34:32,148 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-15 11:34:32,148 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-15 11:34:32,148 INFO L290 TraceCheckUtils]: 141: Hoare triple {30601#false} assume 4432 == #t~mem56;havoc #t~mem56; {30601#false} is VALID [2022-04-15 11:34:32,148 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-15 11:34:32,148 INFO L290 TraceCheckUtils]: 143: Hoare triple {30601#false} assume 5 == ~blastFlag~0; {30601#false} is VALID [2022-04-15 11:34:32,148 INFO L290 TraceCheckUtils]: 144: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-15 11:34:32,149 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-15 11:34:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:32,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381851927] [2022-04-15 11:34:32,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381851927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:32,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:32,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:32,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:32,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145334875] [2022-04-15 11:34:32,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145334875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:32,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:32,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911364793] [2022-04-15 11:34:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:32,150 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-15 11:34:32,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:32,150 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-15 11:34:32,238 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-15 11:34:32,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:32,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:32,239 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-15 11:34:34,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:35,450 INFO L93 Difference]: Finished difference Result 1825 states and 2651 transitions. [2022-04-15 11:34:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:35,450 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-15 11:34:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:35,451 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-15 11:34:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:34:35,453 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-15 11:34:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:34:35,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 11:34:35,792 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-15 11:34:35,843 INFO L225 Difference]: With dead ends: 1825 [2022-04-15 11:34:35,843 INFO L226 Difference]: Without dead ends: 1150 [2022-04-15 11:34:35,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:35,844 INFO L913 BasicCegarLoop]: 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-15 11:34:35,845 INFO L914 BasicCegarLoop]: 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-15 11:34:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-04-15 11:34:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 796. [2022-04-15 11:34:35,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:35,885 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-15 11:34:35,886 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-15 11:34:35,887 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-15 11:34:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:35,951 INFO L93 Difference]: Finished difference Result 1150 states and 1667 transitions. [2022-04-15 11:34:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1667 transitions. [2022-04-15 11:34:35,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:35,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:35,954 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-15 11:34:35,955 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-15 11:34:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:36,043 INFO L93 Difference]: Finished difference Result 1150 states and 1667 transitions. [2022-04-15 11:34:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1667 transitions. [2022-04-15 11:34:36,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:36,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:36,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:36,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:36,046 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-15 11:34:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1164 transitions. [2022-04-15 11:34:36,092 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1164 transitions. Word has length 145 [2022-04-15 11:34:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:36,092 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 1164 transitions. [2022-04-15 11:34:36,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:36,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 796 states and 1164 transitions. [2022-04-15 11:34:37,084 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-15 11:34:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1164 transitions. [2022-04-15 11:34:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:34:37,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:37,087 INFO L499 BasicCegarLoop]: 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-15 11:34:37,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:34:37,087 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1531558103, now seen corresponding path program 1 times [2022-04-15 11:34:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:37,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661888844] [2022-04-15 11:34:37,088 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1531558103, now seen corresponding path program 2 times [2022-04-15 11:34:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:37,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92443147] [2022-04-15 11:34:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,303 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-15 11:34:37,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {38154#true} assume true; {38154#true} is VALID [2022-04-15 11:34:37,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38154#true} {38154#true} #592#return; {38154#true} is VALID [2022-04-15 11:34:37,304 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-15 11:34:37,304 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-15 11:34:37,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {38154#true} assume true; {38154#true} is VALID [2022-04-15 11:34:37,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38154#true} {38154#true} #592#return; {38154#true} is VALID [2022-04-15 11:34:37,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {38154#true} call #t~ret159 := main(); {38154#true} is VALID [2022-04-15 11:34:37,305 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-15 11:34:37,305 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-15 11:34:37,305 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-15 11:34:37,305 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-15 11:34:37,305 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-15 11:34:37,305 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-15 11:34:37,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-15 11:34:37,305 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-15 11:34:37,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {38154#true} assume 12292 == #t~mem43;havoc #t~mem43; {38154#true} is VALID [2022-04-15 11:34:37,306 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-15 11:34:37,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {38154#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {38154#true} is VALID [2022-04-15 11:34:37,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {38154#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {38154#true} is VALID [2022-04-15 11:34:37,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {38154#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {38154#true} is VALID [2022-04-15 11:34:37,306 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-15 11:34:37,306 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-15 11:34:37,306 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-15 11:34:37,306 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-15 11:34:37,306 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-15 11:34:37,306 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-15 11:34:37,306 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-15 11:34:37,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-15 11:34:37,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {38154#true} assume 4368 == #t~mem48;havoc #t~mem48; {38154#true} is VALID [2022-04-15 11:34:37,307 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-15 11:34:37,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {38154#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38154#true} is VALID [2022-04-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,307 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-15 11:34:37,308 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-15 11:34:37,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-15 11:34:37,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 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-15 11:34:37,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {38154#true} assume 4384 == #t~mem50;havoc #t~mem50; {38154#true} is VALID [2022-04-15 11:34:37,309 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-15 11:34:37,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {38154#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38154#true} is VALID [2022-04-15 11:34:37,309 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-15 11:34:37,309 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-15 11:34:37,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {38154#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38154#true} is VALID [2022-04-15 11:34:37,309 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-15 11:34:37,309 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-15 11:34:37,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-15 11:34:37,309 INFO L290 TraceCheckUtils]: 59: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-15 11:34:37,309 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-15 11:34:37,309 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {38154#true} assume 4400 == #t~mem52;havoc #t~mem52; {38154#true} is VALID [2022-04-15 11:34:37,310 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-15 11:34:37,310 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-15 11:34:37,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {38154#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {38154#true} is VALID [2022-04-15 11:34:37,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {38154#true} assume !(~ret~0 <= 0); {38154#true} is VALID [2022-04-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,311 INFO L290 TraceCheckUtils]: 78: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-15 11:34:37,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,311 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-15 11:34:37,312 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-15 11:34:37,312 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-15 11:34:37,312 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-15 11:34:37,312 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-15 11:34:37,312 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-15 11:34:37,312 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-15 11:34:37,312 INFO L290 TraceCheckUtils]: 92: Hoare triple {38154#true} assume 4416 == #t~mem54;havoc #t~mem54; {38154#true} is VALID [2022-04-15 11:34:37,312 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-15 11:34:37,312 INFO L290 TraceCheckUtils]: 94: Hoare triple {38154#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {38154#true} is VALID [2022-04-15 11:34:37,313 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-15 11:34:37,314 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-15 11:34:37,314 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-15 11:34:37,314 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-15 11:34:37,315 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-15 11:34:37,315 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-15 11:34:37,315 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-15 11:34:37,316 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-15 11:34:37,316 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-15 11:34:37,316 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-15 11:34:37,317 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-15 11:34:37,317 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-15 11:34:37,317 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-15 11:34:37,318 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-15 11:34:37,318 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-15 11:34:37,318 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-15 11:34:37,318 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-15 11:34:37,319 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-15 11:34:37,319 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-15 11:34:37,320 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-15 11:34:37,320 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-15 11:34:37,320 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-15 11:34:37,320 INFO L290 TraceCheckUtils]: 117: Hoare triple {38155#false} assume 4448 == #t~mem58;havoc #t~mem58; {38155#false} is VALID [2022-04-15 11:34:37,320 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-15 11:34:37,320 INFO L290 TraceCheckUtils]: 119: Hoare triple {38155#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {38155#false} is VALID [2022-04-15 11:34:37,320 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-15 11:34:37,320 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-15 11:34:37,320 INFO L290 TraceCheckUtils]: 122: Hoare triple {38155#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38155#false} is VALID [2022-04-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 INFO L290 TraceCheckUtils]: 125: Hoare triple {38155#false} ~skip~0 := 0; {38155#false} is VALID [2022-04-15 11:34:37,321 INFO L290 TraceCheckUtils]: 126: Hoare triple {38155#false} assume !false; {38155#false} is VALID [2022-04-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,321 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-15 11:34:37,322 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-15 11:34:37,322 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-15 11:34:37,322 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-15 11:34:37,322 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-15 11:34:37,322 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-15 11:34:37,322 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-15 11:34:37,322 INFO L290 TraceCheckUtils]: 141: Hoare triple {38155#false} assume 4432 == #t~mem56;havoc #t~mem56; {38155#false} is VALID [2022-04-15 11:34:37,322 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-15 11:34:37,322 INFO L290 TraceCheckUtils]: 143: Hoare triple {38155#false} assume 5 == ~blastFlag~0; {38155#false} is VALID [2022-04-15 11:34:37,322 INFO L290 TraceCheckUtils]: 144: Hoare triple {38155#false} assume !false; {38155#false} is VALID [2022-04-15 11:34:37,323 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-15 11:34:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:37,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92443147] [2022-04-15 11:34:37,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92443147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:37,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:37,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:37,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:37,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661888844] [2022-04-15 11:34:37,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661888844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:37,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:37,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836736106] [2022-04-15 11:34:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:37,324 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-15 11:34:37,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:37,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:37,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:37,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:37,414 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-15 11:34:39,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:40,701 INFO L93 Difference]: Finished difference Result 1783 states and 2599 transitions. [2022-04-15 11:34:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:40,702 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-15 11:34:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-15 11:34:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-15 11:34:40,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 414 transitions. [2022-04-15 11:34:40,980 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-15 11:34:41,019 INFO L225 Difference]: With dead ends: 1783 [2022-04-15 11:34:41,019 INFO L226 Difference]: Without dead ends: 1003 [2022-04-15 11:34:41,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:41,021 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 46 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:41,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 525 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:34:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-15 11:34:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 892. [2022-04-15 11:34:41,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:41,065 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-15 11:34:41,066 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-15 11:34:41,067 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-15 11:34:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:41,105 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2022-04-15 11:34:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1451 transitions. [2022-04-15 11:34:41,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:41,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:41,107 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-15 11:34:41,108 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-15 11:34:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:41,152 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2022-04-15 11:34:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1451 transitions. [2022-04-15 11:34:41,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:41,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:41,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:41,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:41,154 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-15 11:34:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1320 transitions. [2022-04-15 11:34:41,215 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1320 transitions. Word has length 145 [2022-04-15 11:34:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:41,215 INFO L478 AbstractCegarLoop]: Abstraction has 892 states and 1320 transitions. [2022-04-15 11:34:41,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:41,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 892 states and 1320 transitions. [2022-04-15 11:34:42,380 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-15 11:34:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1320 transitions. [2022-04-15 11:34:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 11:34:42,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:42,383 INFO L499 BasicCegarLoop]: 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-15 11:34:42,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:34:42,383 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1970264700, now seen corresponding path program 1 times [2022-04-15 11:34:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:42,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007828354] [2022-04-15 11:35:01,753 WARN L232 SmtUtils]: Spent 13.41s 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-15 11:35:09,837 WARN L232 SmtUtils]: Spent 5.01s 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-15 11:35:12,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1970264700, now seen corresponding path program 2 times [2022-04-15 11:35:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:12,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179226872] [2022-04-15 11:35:12,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:12,786 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-15 11:35:12,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {45522#true} assume true; {45522#true} is VALID [2022-04-15 11:35:12,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45522#true} {45522#true} #592#return; {45522#true} is VALID [2022-04-15 11:35:12,787 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-15 11:35:12,788 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-15 11:35:12,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {45522#true} assume true; {45522#true} is VALID [2022-04-15 11:35:12,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45522#true} {45522#true} #592#return; {45522#true} is VALID [2022-04-15 11:35:12,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {45522#true} call #t~ret159 := main(); {45522#true} is VALID [2022-04-15 11:35:12,788 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-15 11:35:12,788 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-15 11:35:12,788 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-15 11:35:12,788 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-15 11:35:12,788 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-15 11:35:12,788 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-15 11:35:12,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-15 11:35:12,789 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-15 11:35:12,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {45522#true} assume 12292 == #t~mem43;havoc #t~mem43; {45522#true} is VALID [2022-04-15 11:35:12,789 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-15 11:35:12,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {45522#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {45522#true} is VALID [2022-04-15 11:35:12,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {45522#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45522#true} is VALID [2022-04-15 11:35:12,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {45522#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {45522#true} is VALID [2022-04-15 11:35:12,789 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-15 11:35:12,789 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-15 11:35:12,789 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-15 11:35:12,789 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-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-15 11:35:12,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,790 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-15 11:35:12,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {45522#true} assume 4368 == #t~mem48;havoc #t~mem48; {45522#true} is VALID [2022-04-15 11:35:12,791 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-15 11:35:12,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {45522#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45522#true} is VALID [2022-04-15 11:35:12,791 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-15 11:35:12,791 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-15 11:35:12,791 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-15 11:35:12,791 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-15 11:35:12,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-15 11:35:12,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-15 11:35:12,791 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-15 11:35:12,792 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-15 11:35:12,792 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-15 11:35:12,792 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-15 11:35:12,792 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-15 11:35:12,792 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-15 11:35:12,792 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-15 11:35:12,792 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-15 11:35:12,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {45522#true} assume 4384 == #t~mem50;havoc #t~mem50; {45522#true} is VALID [2022-04-15 11:35:12,792 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-15 11:35:12,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {45522#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {45522#true} is VALID [2022-04-15 11:35:12,792 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-15 11:35:12,793 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-15 11:35:12,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {45522#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45522#true} is VALID [2022-04-15 11:35:12,793 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-15 11:35:12,793 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-15 11:35:12,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-15 11:35:12,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-15 11:35:12,793 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-15 11:35:12,793 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-15 11:35:12,793 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-15 11:35:12,793 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-15 11:35:12,794 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-15 11:35:12,794 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-15 11:35:12,794 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-15 11:35:12,794 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-15 11:35:12,794 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-15 11:35:12,794 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-15 11:35:12,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {45522#true} assume 4400 == #t~mem52;havoc #t~mem52; {45522#true} is VALID [2022-04-15 11:35:12,794 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-15 11:35:12,794 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-15 11:35:12,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {45522#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {45522#true} is VALID [2022-04-15 11:35:12,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {45522#true} assume !(~ret~0 <= 0); {45522#true} is VALID [2022-04-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,795 INFO L290 TraceCheckUtils]: 78: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-15 11:35:12,795 INFO L290 TraceCheckUtils]: 79: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,795 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-15 11:35:12,796 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-15 11:35:12,796 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-15 11:35:12,796 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-15 11:35:12,796 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-15 11:35:12,796 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-15 11:35:12,796 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-15 11:35:12,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {45522#true} assume 4416 == #t~mem54;havoc #t~mem54; {45522#true} is VALID [2022-04-15 11:35:12,796 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-15 11:35:12,796 INFO L290 TraceCheckUtils]: 94: Hoare triple {45522#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {45522#true} is VALID [2022-04-15 11:35:12,797 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-15 11:35:12,798 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-15 11:35:12,798 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-15 11:35:12,799 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-15 11:35:12,799 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-15 11:35:12,799 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-15 11:35:12,800 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-15 11:35:12,800 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-15 11:35:12,801 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-15 11:35:12,801 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-15 11:35:12,801 INFO L290 TraceCheckUtils]: 105: Hoare triple {45523#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {45523#false} is VALID [2022-04-15 11:35:12,801 INFO L290 TraceCheckUtils]: 106: Hoare triple {45523#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45523#false} is VALID [2022-04-15 11:35:12,801 INFO L290 TraceCheckUtils]: 107: Hoare triple {45523#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {45523#false} is VALID [2022-04-15 11:35:12,801 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-15 11:35:12,801 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 INFO L290 TraceCheckUtils]: 115: Hoare triple {45523#false} ~skip~0 := 0; {45523#false} is VALID [2022-04-15 11:35:12,802 INFO L290 TraceCheckUtils]: 116: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,802 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,803 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-15 11:35:12,804 INFO L290 TraceCheckUtils]: 133: Hoare triple {45523#false} assume 4448 == #t~mem58;havoc #t~mem58; {45523#false} is VALID [2022-04-15 11:35:12,804 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-15 11:35:12,804 INFO L290 TraceCheckUtils]: 135: Hoare triple {45523#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {45523#false} is VALID [2022-04-15 11:35:12,804 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-15 11:35:12,804 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-15 11:35:12,804 INFO L290 TraceCheckUtils]: 138: Hoare triple {45523#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45523#false} is VALID [2022-04-15 11:35:12,804 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-15 11:35:12,804 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-15 11:35:12,804 INFO L290 TraceCheckUtils]: 141: Hoare triple {45523#false} ~skip~0 := 0; {45523#false} is VALID [2022-04-15 11:35:12,804 INFO L290 TraceCheckUtils]: 142: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-15 11:35:12,804 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-15 11:35:12,804 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 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-15 11:35:12,805 INFO L290 TraceCheckUtils]: 157: Hoare triple {45523#false} assume 4432 == #t~mem56;havoc #t~mem56; {45523#false} is VALID [2022-04-15 11:35:12,806 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-15 11:35:12,806 INFO L290 TraceCheckUtils]: 159: Hoare triple {45523#false} assume 5 == ~blastFlag~0; {45523#false} is VALID [2022-04-15 11:35:12,806 INFO L290 TraceCheckUtils]: 160: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-15 11:35:12,806 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-15 11:35:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:12,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179226872] [2022-04-15 11:35:12,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179226872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:12,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:12,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:12,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007828354] [2022-04-15 11:35:12,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007828354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:12,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:12,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648907920] [2022-04-15 11:35:12,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:12,808 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-15 11:35:12,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:12,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:12,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:12,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:12,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:12,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:12,900 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-15 11:35:14,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:16,201 INFO L93 Difference]: Finished difference Result 2162 states and 3203 transitions. [2022-04-15 11:35:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:16,201 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-15 11:35:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 11:35:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 11:35:16,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-15 11:35:16,532 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-15 11:35:16,598 INFO L225 Difference]: With dead ends: 2162 [2022-04-15 11:35:16,598 INFO L226 Difference]: Without dead ends: 1286 [2022-04-15 11:35:16,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:16,600 INFO L913 BasicCegarLoop]: 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-15 11:35:16,601 INFO L914 BasicCegarLoop]: 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-15 11:35:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-15 11:35:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 897. [2022-04-15 11:35:16,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:16,660 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-15 11:35:16,662 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-15 11:35:16,663 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-15 11:35:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:16,738 INFO L93 Difference]: Finished difference Result 1286 states and 1889 transitions. [2022-04-15 11:35:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1889 transitions. [2022-04-15 11:35:16,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:16,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:16,741 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-15 11:35:16,742 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-15 11:35:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:16,818 INFO L93 Difference]: Finished difference Result 1286 states and 1889 transitions. [2022-04-15 11:35:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1889 transitions. [2022-04-15 11:35:16,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:16,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:16,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:16,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:16,821 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-15 11:35:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1316 transitions. [2022-04-15 11:35:16,876 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1316 transitions. Word has length 161 [2022-04-15 11:35:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:16,876 INFO L478 AbstractCegarLoop]: Abstraction has 897 states and 1316 transitions. [2022-04-15 11:35:16,876 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:16,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 897 states and 1316 transitions. [2022-04-15 11:35:18,059 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-15 11:35:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1316 transitions. [2022-04-15 11:35:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-15 11:35:18,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:18,062 INFO L499 BasicCegarLoop]: 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-15 11:35:18,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:35:18,062 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1316927770, now seen corresponding path program 1 times [2022-04-15 11:35:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:18,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413412395] [2022-04-15 11:35:33,573 WARN L232 SmtUtils]: Spent 9.70s 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-15 11:35:43,818 WARN L232 SmtUtils]: Spent 6.47s 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-15 11:35:46,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1316927770, now seen corresponding path program 2 times [2022-04-15 11:35:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664897666] [2022-04-15 11:35:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:46,841 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-15 11:35:46,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {54224#true} assume true; {54224#true} is VALID [2022-04-15 11:35:46,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54224#true} {54224#true} #592#return; {54224#true} is VALID [2022-04-15 11:35:46,842 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-15 11:35:46,842 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-15 11:35:46,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {54224#true} assume true; {54224#true} is VALID [2022-04-15 11:35:46,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54224#true} {54224#true} #592#return; {54224#true} is VALID [2022-04-15 11:35:46,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {54224#true} call #t~ret159 := main(); {54224#true} is VALID [2022-04-15 11:35:46,842 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-15 11:35:46,842 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-15 11:35:46,842 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-15 11:35:46,842 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-15 11:35:46,842 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-15 11:35:46,842 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-15 11:35:46,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-15 11:35:46,842 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-15 11:35:46,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {54224#true} assume 12292 == #t~mem43;havoc #t~mem43; {54224#true} is VALID [2022-04-15 11:35:46,843 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-15 11:35:46,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {54224#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54224#true} is VALID [2022-04-15 11:35:46,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {54224#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54224#true} is VALID [2022-04-15 11:35:46,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {54224#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54224#true} is VALID [2022-04-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-15 11:35:46,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-15 11:35:46,843 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-15 11:35:46,843 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-15 11:35:46,844 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-15 11:35:46,844 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-15 11:35:46,844 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-15 11:35:46,844 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-15 11:35:46,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {54224#true} assume 4368 == #t~mem48;havoc #t~mem48; {54224#true} is VALID [2022-04-15 11:35:46,844 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-15 11:35:46,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {54224#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54224#true} is VALID [2022-04-15 11:35:46,844 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-15 11:35:46,844 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-15 11:35:46,844 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-15 11:35:46,844 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-15 11:35:46,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-15 11:35:46,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,845 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-15 11:35:46,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {54224#true} assume 4384 == #t~mem50;havoc #t~mem50; {54224#true} is VALID [2022-04-15 11:35:46,846 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-15 11:35:46,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {54224#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54224#true} is VALID [2022-04-15 11:35:46,846 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-15 11:35:46,846 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-15 11:35:46,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {54224#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54224#true} is VALID [2022-04-15 11:35:46,846 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-15 11:35:46,846 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-15 11:35:46,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-15 11:35:46,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-15 11:35:46,846 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-15 11:35:46,846 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-15 11:35:46,846 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-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {54224#true} assume 4400 == #t~mem52;havoc #t~mem52; {54224#true} is VALID [2022-04-15 11:35:46,847 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-15 11:35:46,847 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-15 11:35:46,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {54224#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {54224#true} is VALID [2022-04-15 11:35:46,847 INFO L290 TraceCheckUtils]: 74: Hoare triple {54224#true} assume !(~ret~0 <= 0); {54224#true} is VALID [2022-04-15 11:35:46,847 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 INFO L290 TraceCheckUtils]: 78: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-15 11:35:46,848 INFO L290 TraceCheckUtils]: 79: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,848 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-15 11:35:46,849 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-15 11:35:46,849 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-15 11:35:46,849 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-15 11:35:46,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {54224#true} assume 4416 == #t~mem54;havoc #t~mem54; {54224#true} is VALID [2022-04-15 11:35:46,849 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-15 11:35:46,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {54224#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {54224#true} is VALID [2022-04-15 11:35:46,850 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-15 11:35:46,851 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-15 11:35:46,851 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-15 11:35:46,851 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-15 11:35:46,852 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-15 11:35:46,852 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-15 11:35:46,852 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-15 11:35:46,852 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-15 11:35:46,853 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-15 11:35:46,853 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-15 11:35:46,853 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-15 11:35:46,854 INFO L290 TraceCheckUtils]: 106: Hoare triple {54225#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54225#false} is VALID [2022-04-15 11:35:46,854 INFO L290 TraceCheckUtils]: 107: Hoare triple {54225#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54225#false} is VALID [2022-04-15 11:35:46,854 INFO L290 TraceCheckUtils]: 108: Hoare triple {54225#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54225#false} is VALID [2022-04-15 11:35:46,854 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-15 11:35:46,854 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-15 11:35:46,854 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-15 11:35:46,854 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-15 11:35:46,854 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-15 11:35:46,854 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-15 11:35:46,854 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-15 11:35:46,854 INFO L290 TraceCheckUtils]: 116: Hoare triple {54225#false} ~skip~0 := 0; {54225#false} is VALID [2022-04-15 11:35:46,855 INFO L290 TraceCheckUtils]: 117: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,855 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-15 11:35:46,856 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-15 11:35:46,856 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-15 11:35:46,856 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-15 11:35:46,856 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-15 11:35:46,856 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-15 11:35:46,856 INFO L290 TraceCheckUtils]: 134: Hoare triple {54225#false} assume 4448 == #t~mem58;havoc #t~mem58; {54225#false} is VALID [2022-04-15 11:35:46,856 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-15 11:35:46,856 INFO L290 TraceCheckUtils]: 136: Hoare triple {54225#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {54225#false} is VALID [2022-04-15 11:35:46,856 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-15 11:35:46,856 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-15 11:35:46,856 INFO L290 TraceCheckUtils]: 139: Hoare triple {54225#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54225#false} is VALID [2022-04-15 11:35:46,856 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-15 11:35:46,857 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-15 11:35:46,857 INFO L290 TraceCheckUtils]: 142: Hoare triple {54225#false} ~skip~0 := 0; {54225#false} is VALID [2022-04-15 11:35:46,857 INFO L290 TraceCheckUtils]: 143: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,857 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-15 11:35:46,858 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-15 11:35:46,858 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-15 11:35:46,858 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-15 11:35:46,858 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-15 11:35:46,858 INFO L290 TraceCheckUtils]: 158: Hoare triple {54225#false} assume 4432 == #t~mem56;havoc #t~mem56; {54225#false} is VALID [2022-04-15 11:35:46,858 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-15 11:35:46,858 INFO L290 TraceCheckUtils]: 160: Hoare triple {54225#false} assume 5 == ~blastFlag~0; {54225#false} is VALID [2022-04-15 11:35:46,858 INFO L290 TraceCheckUtils]: 161: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-15 11:35:46,859 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-15 11:35:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:46,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664897666] [2022-04-15 11:35:46,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664897666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:46,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:46,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:46,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:46,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413412395] [2022-04-15 11:35:46,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413412395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:46,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:46,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:46,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410044618] [2022-04-15 11:35:46,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:46,863 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-15 11:35:46,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:46,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:46,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:46,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:46,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:46,946 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-15 11:35:48,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:50,234 INFO L93 Difference]: Finished difference Result 1889 states and 2743 transitions. [2022-04-15 11:35:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:50,235 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-15 11:35:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-04-15 11:35:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-04-15 11:35:50,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 412 transitions. [2022-04-15 11:35:50,515 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-15 11:35:50,553 INFO L225 Difference]: With dead ends: 1889 [2022-04-15 11:35:50,554 INFO L226 Difference]: Without dead ends: 1008 [2022-04-15 11:35:50,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:35:50,555 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 54 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:50,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 523 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:35:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-04-15 11:35:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 897. [2022-04-15 11:35:50,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:50,617 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-15 11:35:50,619 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-15 11:35:50,620 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-15 11:35:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:50,668 INFO L93 Difference]: Finished difference Result 1008 states and 1443 transitions. [2022-04-15 11:35:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1443 transitions. [2022-04-15 11:35:50,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:50,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:50,671 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-15 11:35:50,673 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-15 11:35:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:50,724 INFO L93 Difference]: Finished difference Result 1008 states and 1443 transitions. [2022-04-15 11:35:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1443 transitions. [2022-04-15 11:35:50,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:50,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:50,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:50,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:50,728 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-15 11:35:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1312 transitions. [2022-04-15 11:35:50,782 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1312 transitions. Word has length 162 [2022-04-15 11:35:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:50,783 INFO L478 AbstractCegarLoop]: Abstraction has 897 states and 1312 transitions. [2022-04-15 11:35:50,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:35:50,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 897 states and 1312 transitions. [2022-04-15 11:35:52,017 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-15 11:35:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1312 transitions. [2022-04-15 11:35:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 11:35:52,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:52,018 INFO L499 BasicCegarLoop]: 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-15 11:35:52,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:35:52,019 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1395645249, now seen corresponding path program 1 times [2022-04-15 11:35:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:52,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703093430] [2022-04-15 11:36:11,097 WARN L232 SmtUtils]: Spent 12.91s 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-15 11:36:20,230 WARN L232 SmtUtils]: Spent 5.76s 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-15 11:36:22,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1395645249, now seen corresponding path program 2 times [2022-04-15 11:36:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:22,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119793687] [2022-04-15 11:36:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:23,048 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-15 11:36:23,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {61824#true} assume true; {61824#true} is VALID [2022-04-15 11:36:23,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61824#true} {61824#true} #592#return; {61824#true} is VALID [2022-04-15 11:36:23,049 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-15 11:36:23,049 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-15 11:36:23,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {61824#true} assume true; {61824#true} is VALID [2022-04-15 11:36:23,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61824#true} {61824#true} #592#return; {61824#true} is VALID [2022-04-15 11:36:23,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {61824#true} call #t~ret159 := main(); {61824#true} is VALID [2022-04-15 11:36:23,050 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-15 11:36:23,050 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-15 11:36:23,050 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-15 11:36:23,050 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-15 11:36:23,050 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-15 11:36:23,050 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-15 11:36:23,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-15 11:36:23,051 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-15 11:36:23,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {61824#true} assume 12292 == #t~mem43;havoc #t~mem43; {61824#true} is VALID [2022-04-15 11:36:23,051 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-15 11:36:23,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {61824#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61824#true} is VALID [2022-04-15 11:36:23,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {61824#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61824#true} is VALID [2022-04-15 11:36:23,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {61824#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {61824#true} is VALID [2022-04-15 11:36:23,051 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-15 11:36:23,051 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-15 11:36:23,051 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-15 11:36:23,051 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-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-15 11:36:23,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 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-15 11:36:23,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {61824#true} assume 4368 == #t~mem48;havoc #t~mem48; {61824#true} is VALID [2022-04-15 11:36:23,053 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-15 11:36:23,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {61824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61824#true} is VALID [2022-04-15 11:36:23,053 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-15 11:36:23,053 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-15 11:36:23,053 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-15 11:36:23,053 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-15 11:36:23,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-15 11:36:23,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-15 11:36:23,053 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-15 11:36:23,053 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-15 11:36:23,053 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-15 11:36:23,054 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-15 11:36:23,054 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-15 11:36:23,054 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-15 11:36:23,054 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-15 11:36:23,054 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-15 11:36:23,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {61824#true} assume 4384 == #t~mem50;havoc #t~mem50; {61824#true} is VALID [2022-04-15 11:36:23,054 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-15 11:36:23,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {61824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61824#true} is VALID [2022-04-15 11:36:23,054 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-15 11:36:23,054 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-15 11:36:23,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {61824#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61824#true} is VALID [2022-04-15 11:36:23,054 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-15 11:36:23,055 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-15 11:36:23,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-15 11:36:23,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,055 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-15 11:36:23,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {61824#true} assume 4400 == #t~mem52;havoc #t~mem52; {61824#true} is VALID [2022-04-15 11:36:23,056 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-15 11:36:23,056 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-15 11:36:23,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {61824#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {61824#true} is VALID [2022-04-15 11:36:23,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {61824#true} assume !(~ret~0 <= 0); {61824#true} is VALID [2022-04-15 11:36:23,056 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-15 11:36:23,056 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-15 11:36:23,056 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-15 11:36:23,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-15 11:36:23,056 INFO L290 TraceCheckUtils]: 79: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-15 11:36:23,056 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-15 11:36:23,056 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 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-15 11:36:23,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {61824#true} assume 4416 == #t~mem54;havoc #t~mem54; {61824#true} is VALID [2022-04-15 11:36:23,057 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-15 11:36:23,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {61824#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {61824#true} is VALID [2022-04-15 11:36:23,059 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-15 11:36:23,059 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-15 11:36:23,059 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-15 11:36:23,060 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-15 11:36:23,060 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-15 11:36:23,060 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-15 11:36:23,061 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-15 11:36:23,061 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-15 11:36:23,061 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-15 11:36:23,062 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-15 11:36:23,062 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-15 11:36:23,062 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-15 11:36:23,063 INFO L290 TraceCheckUtils]: 107: Hoare triple {61825#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61825#false} is VALID [2022-04-15 11:36:23,063 INFO L290 TraceCheckUtils]: 108: Hoare triple {61825#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61825#false} is VALID [2022-04-15 11:36:23,063 INFO L290 TraceCheckUtils]: 109: Hoare triple {61825#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {61825#false} is VALID [2022-04-15 11:36:23,063 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-15 11:36:23,063 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-15 11:36:23,063 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-15 11:36:23,063 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-15 11:36:23,063 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-15 11:36:23,063 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-15 11:36:23,063 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-15 11:36:23,063 INFO L290 TraceCheckUtils]: 117: Hoare triple {61825#false} ~skip~0 := 0; {61825#false} is VALID [2022-04-15 11:36:23,063 INFO L290 TraceCheckUtils]: 118: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,064 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-15 11:36:23,065 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-15 11:36:23,065 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-15 11:36:23,065 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-15 11:36:23,065 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-15 11:36:23,065 INFO L290 TraceCheckUtils]: 135: Hoare triple {61825#false} assume 4448 == #t~mem58;havoc #t~mem58; {61825#false} is VALID [2022-04-15 11:36:23,065 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-15 11:36:23,065 INFO L290 TraceCheckUtils]: 137: Hoare triple {61825#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {61825#false} is VALID [2022-04-15 11:36:23,065 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-15 11:36:23,065 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-15 11:36:23,065 INFO L290 TraceCheckUtils]: 140: Hoare triple {61825#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61825#false} is VALID [2022-04-15 11:36:23,065 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-15 11:36:23,065 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-15 11:36:23,066 INFO L290 TraceCheckUtils]: 143: Hoare triple {61825#false} ~skip~0 := 0; {61825#false} is VALID [2022-04-15 11:36:23,066 INFO L290 TraceCheckUtils]: 144: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,066 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-15 11:36:23,067 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-15 11:36:23,067 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-15 11:36:23,067 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-15 11:36:23,067 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-15 11:36:23,067 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-15 11:36:23,067 INFO L290 TraceCheckUtils]: 159: Hoare triple {61825#false} assume 4432 == #t~mem56;havoc #t~mem56; {61825#false} is VALID [2022-04-15 11:36:23,067 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-15 11:36:23,067 INFO L290 TraceCheckUtils]: 161: Hoare triple {61825#false} assume 5 == ~blastFlag~0; {61825#false} is VALID [2022-04-15 11:36:23,067 INFO L290 TraceCheckUtils]: 162: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-15 11:36:23,068 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-15 11:36:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119793687] [2022-04-15 11:36:23,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119793687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:23,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:23,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:23,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703093430] [2022-04-15 11:36:23,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703093430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:23,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:23,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358727256] [2022-04-15 11:36:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:23,070 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-15 11:36:23,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:23,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:23,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:23,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:23,165 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-15 11:36:25,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:26,420 INFO L93 Difference]: Finished difference Result 2167 states and 3177 transitions. [2022-04-15 11:36:26,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:26,421 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-15 11:36:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-15 11:36:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-15 11:36:26,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-15 11:36:26,761 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-15 11:36:26,823 INFO L225 Difference]: With dead ends: 2167 [2022-04-15 11:36:26,823 INFO L226 Difference]: Without dead ends: 1286 [2022-04-15 11:36:26,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:36:26,825 INFO L913 BasicCegarLoop]: 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-15 11:36:26,825 INFO L914 BasicCegarLoop]: 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-15 11:36:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-15 11:36:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 907. [2022-04-15 11:36:26,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:26,884 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-15 11:36:26,885 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-15 11:36:26,886 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-15 11:36:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:26,965 INFO L93 Difference]: Finished difference Result 1286 states and 1871 transitions. [2022-04-15 11:36:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1871 transitions. [2022-04-15 11:36:26,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:26,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:26,968 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-15 11:36:26,969 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-15 11:36:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:27,047 INFO L93 Difference]: Finished difference Result 1286 states and 1871 transitions. [2022-04-15 11:36:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1871 transitions. [2022-04-15 11:36:27,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:27,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:27,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:27,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:27,050 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-15 11:36:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1318 transitions. [2022-04-15 11:36:27,130 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1318 transitions. Word has length 163 [2022-04-15 11:36:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:27,131 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1318 transitions. [2022-04-15 11:36:27,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:36:27,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1318 transitions. [2022-04-15 11:36:28,284 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-15 11:36:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1318 transitions. [2022-04-15 11:36:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 11:36:28,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:28,289 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:28,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:36:28,289 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:28,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -863179426, now seen corresponding path program 1 times [2022-04-15 11:36:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975566374] [2022-04-15 11:36:38,480 WARN L232 SmtUtils]: Spent 10.19s 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-15 11:36:48,518 WARN L232 SmtUtils]: Spent 6.83s 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-15 11:36:55,264 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash -863179426, now seen corresponding path program 2 times [2022-04-15 11:36:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:55,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329911945] [2022-04-15 11:36:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:55,481 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-15 11:36:55,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-15 11:36:55,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-15 11:36:55,482 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-15 11:36:55,482 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-15 11:36:55,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-15 11:36:55,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-15 11:36:55,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {70556#true} call #t~ret159 := main(); {70556#true} is VALID [2022-04-15 11:36:55,483 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-15 11:36:55,483 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-15 11:36:55,483 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-15 11:36:55,483 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-15 11:36:55,483 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-15 11:36:55,483 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-15 11:36:55,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:36:55,483 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-15 11:36:55,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {70556#true} assume 12292 == #t~mem43;havoc #t~mem43; {70556#true} is VALID [2022-04-15 11:36:55,483 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-15 11:36:55,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {70556#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70556#true} is VALID [2022-04-15 11:36:55,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {70556#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70556#true} is VALID [2022-04-15 11:36:55,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {70556#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70556#true} is VALID [2022-04-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-15 11:36:55,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:36:55,484 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-15 11:36:55,484 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-15 11:36:55,485 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-15 11:36:55,485 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-15 11:36:55,485 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-15 11:36:55,485 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-15 11:36:55,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {70556#true} assume 4368 == #t~mem48;havoc #t~mem48; {70556#true} is VALID [2022-04-15 11:36:55,485 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-15 11:36:55,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {70556#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70556#true} is VALID [2022-04-15 11:36:55,485 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-15 11:36:55,485 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-15 11:36:55,485 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-15 11:36:55,485 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-15 11:36:55,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-15 11:36:55,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 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-15 11:36:55,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {70556#true} assume 4384 == #t~mem50;havoc #t~mem50; {70556#true} is VALID [2022-04-15 11:36:55,487 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-15 11:36:55,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {70556#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70556#true} is VALID [2022-04-15 11:36:55,487 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-15 11:36:55,488 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-15 11:36:55,489 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-15 11:36:55,489 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-15 11:36:55,489 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-15 11:36:55,490 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-15 11:36:55,490 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-15 11:36:55,490 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-15 11:36:55,491 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-15 11:36:55,491 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-15 11:36:55,491 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-15 11:36:55,492 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-15 11:36:55,492 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-15 11:36:55,492 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-15 11:36:55,492 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-15 11:36:55,493 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-15 11:36:55,493 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-15 11:36:55,493 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-15 11:36:55,494 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-15 11:36:55,494 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-15 11:36:55,494 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-15 11:36:55,495 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-15 11:36:55,496 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-15 11:36:55,496 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-15 11:36:55,496 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-15 11:36:55,497 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-15 11:36:55,497 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-15 11:36:55,497 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-15 11:36:55,498 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-15 11:36:55,498 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-15 11:36:55,498 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-15 11:36:55,498 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-15 11:36:55,499 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-15 11:36:55,499 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-15 11:36:55,499 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-15 11:36:55,500 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-15 11:36:55,500 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-15 11:36:55,500 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-15 11:36:55,501 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-15 11:36:55,501 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-15 11:36:55,501 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-15 11:36:55,501 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-15 11:36:55,503 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-15 11:36:55,503 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-15 11:36:55,503 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-15 11:36:55,504 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-15 11:36:55,504 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-15 11:36:55,504 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-15 11:36:55,505 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-15 11:36:55,505 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-15 11:36:55,505 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-15 11:36:55,505 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-15 11:36:55,506 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-15 11:36:55,506 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-15 11:36:55,506 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-15 11:36:55,507 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-15 11:36:55,507 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-15 11:36:55,507 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-15 11:36:55,508 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-15 11:36:55,508 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-15 11:36:55,508 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-15 11:36:55,508 INFO L290 TraceCheckUtils]: 114: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 INFO L290 TraceCheckUtils]: 117: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-15 11:36:55,509 INFO L290 TraceCheckUtils]: 118: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,509 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,510 INFO L290 TraceCheckUtils]: 135: Hoare triple {70557#false} assume 4448 == #t~mem58;havoc #t~mem58; {70557#false} is VALID [2022-04-15 11:36:55,510 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-15 11:36:55,510 INFO L290 TraceCheckUtils]: 137: Hoare triple {70557#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70557#false} is VALID [2022-04-15 11:36:55,510 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-15 11:36:55,510 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-15 11:36:55,511 INFO L290 TraceCheckUtils]: 140: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,511 INFO L290 TraceCheckUtils]: 143: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-15 11:36:55,511 INFO L290 TraceCheckUtils]: 144: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,511 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-15 11:36:55,512 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-15 11:36:55,512 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-15 11:36:55,512 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-15 11:36:55,512 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-15 11:36:55,512 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-15 11:36:55,512 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-15 11:36:55,512 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-15 11:36:55,512 INFO L290 TraceCheckUtils]: 159: Hoare triple {70557#false} assume 4432 == #t~mem56;havoc #t~mem56; {70557#false} is VALID [2022-04-15 11:36:55,512 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-15 11:36:55,512 INFO L290 TraceCheckUtils]: 161: Hoare triple {70557#false} assume 5 == ~blastFlag~0; {70557#false} is VALID [2022-04-15 11:36:55,512 INFO L290 TraceCheckUtils]: 162: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-15 11:36:55,513 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-15 11:36:55,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:55,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329911945] [2022-04-15 11:36:55,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329911945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:36:55,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757615648] [2022-04-15 11:36:55,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:36:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:36:55,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:36:55,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:36:55,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 11:37:32,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:37:32,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:37:32,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 11:37:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:32,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:37:32,713 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:37:32,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-15 11:37:32,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:37:32,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {70556#true} call ULTIMATE.init(); {70556#true} is VALID [2022-04-15 11:37:32,871 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-15 11:37:32,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-15 11:37:32,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-15 11:37:32,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {70556#true} call #t~ret159 := main(); {70556#true} is VALID [2022-04-15 11:37:32,872 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-15 11:37:32,872 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-15 11:37:32,872 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-15 11:37:32,872 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-15 11:37:32,872 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-15 11:37:32,872 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-15 11:37:32,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:37:32,872 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-15 11:37:32,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {70556#true} assume 12292 == #t~mem43;havoc #t~mem43; {70556#true} is VALID [2022-04-15 11:37:32,872 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-15 11:37:32,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {70556#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70556#true} is VALID [2022-04-15 11:37:32,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {70556#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70556#true} is VALID [2022-04-15 11:37:32,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {70556#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70556#true} is VALID [2022-04-15 11:37:32,872 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-15 11:37:32,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 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-15 11:37:32,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {70556#true} assume 4368 == #t~mem48;havoc #t~mem48; {70556#true} is VALID [2022-04-15 11:37:32,873 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-15 11:37:32,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {70556#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70556#true} is VALID [2022-04-15 11:37:32,873 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-15 11:37:32,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 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-15 11:37:32,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {70556#true} assume 4384 == #t~mem50;havoc #t~mem50; {70556#true} is VALID [2022-04-15 11:37:32,874 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-15 11:37:32,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {70556#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70556#true} is VALID [2022-04-15 11:37:32,875 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-15 11:37:32,875 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-15 11:37:32,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {70556#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-15 11:37:32,875 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-15 11:37:32,875 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-15 11:37:32,875 INFO L290 TraceCheckUtils]: 58: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-15 11:37:32,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:37:32,875 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-15 11:37:32,875 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-15 11:37:32,875 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-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {70556#true} assume 4400 == #t~mem52;havoc #t~mem52; {70556#true} is VALID [2022-04-15 11:37:32,876 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-15 11:37:32,876 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-15 11:37:32,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {70556#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70556#true} is VALID [2022-04-15 11:37:32,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {70556#true} assume !(~ret~0 <= 0); {70556#true} is VALID [2022-04-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-15 11:37:32,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,877 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-15 11:37:32,878 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-15 11:37:32,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {70556#true} assume 4416 == #t~mem54;havoc #t~mem54; {70556#true} is VALID [2022-04-15 11:37:32,878 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-15 11:37:32,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {70556#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70556#true} is VALID [2022-04-15 11:37:32,879 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-15 11:37:32,879 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-15 11:37:32,879 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-15 11:37:32,880 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-15 11:37:32,880 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-15 11:37:32,880 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-15 11:37:32,881 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-15 11:37:32,881 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-15 11:37:32,881 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-15 11:37:32,881 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-15 11:37:32,882 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-15 11:37:32,882 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-15 11:37:32,882 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-15 11:37:32,883 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-15 11:37:32,883 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-15 11:37:32,883 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-15 11:37:32,883 INFO L290 TraceCheckUtils]: 111: Hoare triple {70557#false} assume !(1 == ~blastFlag~0); {70557#false} is VALID [2022-04-15 11:37:32,883 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-15 11:37:32,883 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-15 11:37:32,883 INFO L290 TraceCheckUtils]: 114: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-15 11:37:32,883 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-15 11:37:32,883 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-15 11:37:32,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-15 11:37:32,883 INFO L290 TraceCheckUtils]: 118: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-15 11:37:32,883 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-15 11:37:32,883 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,884 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-15 11:37:32,885 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-15 11:37:32,885 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-15 11:37:32,885 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-15 11:37:32,885 INFO L290 TraceCheckUtils]: 135: Hoare triple {70557#false} assume 4448 == #t~mem58;havoc #t~mem58; {70557#false} is VALID [2022-04-15 11:37:32,885 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-15 11:37:32,885 INFO L290 TraceCheckUtils]: 137: Hoare triple {70557#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70557#false} is VALID [2022-04-15 11:37:32,885 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-15 11:37:32,885 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-15 11:37:32,885 INFO L290 TraceCheckUtils]: 140: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-15 11:37:32,885 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-15 11:37:32,885 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-15 11:37:32,886 INFO L290 TraceCheckUtils]: 143: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-15 11:37:32,886 INFO L290 TraceCheckUtils]: 144: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,886 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-15 11:37:32,887 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-15 11:37:32,887 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-15 11:37:32,887 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-15 11:37:32,887 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-15 11:37:32,887 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-15 11:37:32,887 INFO L290 TraceCheckUtils]: 159: Hoare triple {70557#false} assume 4432 == #t~mem56;havoc #t~mem56; {70557#false} is VALID [2022-04-15 11:37:32,887 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-15 11:37:32,887 INFO L290 TraceCheckUtils]: 161: Hoare triple {70557#false} assume 5 == ~blastFlag~0; {70557#false} is VALID [2022-04-15 11:37:32,887 INFO L290 TraceCheckUtils]: 162: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-15 11:37:32,888 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-15 11:37:32,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:37:32,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757615648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:32,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:37:32,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-04-15 11:37:32,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:32,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975566374] [2022-04-15 11:37:32,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975566374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:32,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:32,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119414313] [2022-04-15 11:37:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:32,890 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-15 11:37:32,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:32,890 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-15 11:37:32,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:32,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:37:32,972 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-15 11:37:37,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:39,790 INFO L93 Difference]: Finished difference Result 1873 states and 2703 transitions. [2022-04-15 11:37:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:39,790 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-15 11:37:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:39,791 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-15 11:37:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2022-04-15 11:37:39,792 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-15 11:37:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2022-04-15 11:37:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 399 transitions. [2022-04-15 11:37:40,069 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-15 11:37:40,106 INFO L225 Difference]: With dead ends: 1873 [2022-04-15 11:37:40,107 INFO L226 Difference]: Without dead ends: 982 [2022-04-15 11:37:40,108 INFO L912 BasicCegarLoop]: 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-15 11:37:40,109 INFO L913 BasicCegarLoop]: 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-15 11:37:40,109 INFO L914 BasicCegarLoop]: 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-15 11:37:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-15 11:37:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 907. [2022-04-15 11:37:40,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:40,166 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-15 11:37:40,167 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-15 11:37:40,168 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-15 11:37:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:40,214 INFO L93 Difference]: Finished difference Result 982 states and 1401 transitions. [2022-04-15 11:37:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2022-04-15 11:37:40,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:40,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:40,217 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-15 11:37:40,218 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-15 11:37:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:40,266 INFO L93 Difference]: Finished difference Result 982 states and 1401 transitions. [2022-04-15 11:37:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2022-04-15 11:37:40,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:40,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:40,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:40,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:40,269 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-15 11:37:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1314 transitions. [2022-04-15 11:37:40,330 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1314 transitions. Word has length 163 [2022-04-15 11:37:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:40,331 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1314 transitions. [2022-04-15 11:37:40,331 INFO L479 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-15 11:37:40,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1314 transitions. [2022-04-15 11:37:41,488 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-15 11:37:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1314 transitions. [2022-04-15 11:37:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-15 11:37:41,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:41,490 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:41,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 11:37:41,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 11:37:41,690 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1898118871, now seen corresponding path program 1 times [2022-04-15 11:37:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:41,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666346163] [2022-04-15 11:37:58,570 WARN L232 SmtUtils]: Spent 16.87s 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-15 11:38:08,846 WARN L232 SmtUtils]: Spent 6.64s 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-15 11:38:15,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1898118871, now seen corresponding path program 2 times [2022-04-15 11:38:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:15,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082014280] [2022-04-15 11:38:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:15,865 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-15 11:38:15,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-15 11:38:15,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-15 11:38:15,868 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-15 11:38:15,868 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-15 11:38:15,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-15 11:38:15,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-15 11:38:15,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {78581#true} call #t~ret159 := main(); {78581#true} is VALID [2022-04-15 11:38:15,868 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-15 11:38:15,868 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-15 11:38:15,868 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-15 11:38:15,868 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-15 11:38:15,868 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-15 11:38:15,869 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-15 11:38:15,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:38:15,869 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-15 11:38:15,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {78581#true} assume 12292 == #t~mem43;havoc #t~mem43; {78581#true} is VALID [2022-04-15 11:38:15,869 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-15 11:38:15,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {78581#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78581#true} is VALID [2022-04-15 11:38:15,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {78581#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78581#true} is VALID [2022-04-15 11:38:15,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {78581#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78581#true} is VALID [2022-04-15 11:38:15,869 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-15 11:38:15,869 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-15 11:38:15,869 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-15 11:38:15,869 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-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-15 11:38:15,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 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-15 11:38:15,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {78581#true} assume 4368 == #t~mem48;havoc #t~mem48; {78581#true} is VALID [2022-04-15 11:38:15,871 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-15 11:38:15,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {78581#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78581#true} is VALID [2022-04-15 11:38:15,871 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-15 11:38:15,871 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-15 11:38:15,871 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-15 11:38:15,871 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-15 11:38:15,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-15 11:38:15,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:38:15,871 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-15 11:38:15,871 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-15 11:38:15,871 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-15 11:38:15,871 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-15 11:38:15,872 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-15 11:38:15,872 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-15 11:38:15,872 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-15 11:38:15,872 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-15 11:38:15,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {78581#true} assume 4384 == #t~mem50;havoc #t~mem50; {78581#true} is VALID [2022-04-15 11:38:15,872 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-15 11:38:15,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {78581#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78581#true} is VALID [2022-04-15 11:38:15,873 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-15 11:38:15,873 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-15 11:38:15,874 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-15 11:38:15,875 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-15 11:38:15,875 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-15 11:38:15,875 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-15 11:38:15,875 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-15 11:38:15,876 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-15 11:38:15,876 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-15 11:38:15,876 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-15 11:38:15,877 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-15 11:38:15,877 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-15 11:38:15,877 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-15 11:38:15,878 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-15 11:38:15,878 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-15 11:38:15,878 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-15 11:38:15,879 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-15 11:38:15,879 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-15 11:38:15,879 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-15 11:38:15,880 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-15 11:38:15,880 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-15 11:38:15,880 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-15 11:38:15,881 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-15 11:38:15,882 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-15 11:38:15,882 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-15 11:38:15,882 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-15 11:38:15,883 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-15 11:38:15,883 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-15 11:38:15,883 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-15 11:38:15,884 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-15 11:38:15,884 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-15 11:38:15,884 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-15 11:38:15,885 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-15 11:38:15,885 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-15 11:38:15,885 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-15 11:38:15,886 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-15 11:38:15,886 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-15 11:38:15,886 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-15 11:38:15,887 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-15 11:38:15,887 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-15 11:38:15,887 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-15 11:38:15,887 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-15 11:38:15,889 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-15 11:38:15,889 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-15 11:38:15,889 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-15 11:38:15,890 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-15 11:38:15,890 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-15 11:38:15,890 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-15 11:38:15,891 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-15 11:38:15,891 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-15 11:38:15,891 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-15 11:38:15,892 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-15 11:38:15,892 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-15 11:38:15,892 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-15 11:38:15,893 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-15 11:38:15,893 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-15 11:38:15,893 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-15 11:38:15,894 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-15 11:38:15,894 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-15 11:38:15,894 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-15 11:38:15,895 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-15 11:38:15,895 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-15 11:38:15,895 INFO L290 TraceCheckUtils]: 115: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-15 11:38:15,895 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-15 11:38:15,896 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-15 11:38:15,896 INFO L290 TraceCheckUtils]: 118: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-15 11:38:15,896 INFO L290 TraceCheckUtils]: 119: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,896 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 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-15 11:38:15,897 INFO L290 TraceCheckUtils]: 136: Hoare triple {78582#false} assume 4448 == #t~mem58;havoc #t~mem58; {78582#false} is VALID [2022-04-15 11:38:15,897 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-15 11:38:15,897 INFO L290 TraceCheckUtils]: 138: Hoare triple {78582#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {78582#false} is VALID [2022-04-15 11:38:15,897 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-15 11:38:15,898 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-15 11:38:15,898 INFO L290 TraceCheckUtils]: 141: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-15 11:38:15,898 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-15 11:38:15,898 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-15 11:38:15,898 INFO L290 TraceCheckUtils]: 144: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-15 11:38:15,898 INFO L290 TraceCheckUtils]: 145: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-15 11:38:15,898 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-15 11:38:15,898 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-15 11:38:15,898 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-15 11:38:15,898 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 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-15 11:38:15,899 INFO L290 TraceCheckUtils]: 160: Hoare triple {78582#false} assume 4432 == #t~mem56;havoc #t~mem56; {78582#false} is VALID [2022-04-15 11:38:15,899 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-15 11:38:15,900 INFO L290 TraceCheckUtils]: 162: Hoare triple {78582#false} assume 5 == ~blastFlag~0; {78582#false} is VALID [2022-04-15 11:38:15,900 INFO L290 TraceCheckUtils]: 163: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-15 11:38:15,900 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-15 11:38:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:15,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082014280] [2022-04-15 11:38:15,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082014280] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:38:15,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137239020] [2022-04-15 11:38:15,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:38:15,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:38:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:38:15,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:38:15,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 11:39:51,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:39:51,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:39:51,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 11:39:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:51,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:39:52,184 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:39:52,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-15 11:39:52,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:39:52,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {78581#true} call ULTIMATE.init(); {78581#true} is VALID [2022-04-15 11:39:52,364 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-15 11:39:52,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-15 11:39:52,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-15 11:39:52,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {78581#true} call #t~ret159 := main(); {78581#true} is VALID [2022-04-15 11:39:52,365 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-15 11:39:52,365 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-15 11:39:52,365 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-15 11:39:52,365 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-15 11:39:52,365 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-15 11:39:52,365 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-15 11:39:52,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:39:52,365 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-15 11:39:52,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {78581#true} assume 12292 == #t~mem43;havoc #t~mem43; {78581#true} is VALID [2022-04-15 11:39:52,365 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-15 11:39:52,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {78581#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78581#true} is VALID [2022-04-15 11:39:52,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {78581#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78581#true} is VALID [2022-04-15 11:39:52,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {78581#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78581#true} is VALID [2022-04-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-15 11:39:52,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,366 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-15 11:39:52,367 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-15 11:39:52,367 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-15 11:39:52,367 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-15 11:39:52,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {78581#true} assume 4368 == #t~mem48;havoc #t~mem48; {78581#true} is VALID [2022-04-15 11:39:52,367 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-15 11:39:52,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {78581#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78581#true} is VALID [2022-04-15 11:39:52,367 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-15 11:39:52,367 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-15 11:39:52,367 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-15 11:39:52,367 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-15 11:39:52,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-15 11:39:52,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:39:52,367 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-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {78581#true} assume 4384 == #t~mem50;havoc #t~mem50; {78581#true} is VALID [2022-04-15 11:39:52,368 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-15 11:39:52,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {78581#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78581#true} is VALID [2022-04-15 11:39:52,368 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-15 11:39:52,368 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-15 11:39:52,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {78581#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-15 11:39:52,369 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-15 11:39:52,369 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-15 11:39:52,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-15 11:39:52,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:39:52,369 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-15 11:39:52,369 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-15 11:39:52,369 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-15 11:39:52,369 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-15 11:39:52,369 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-15 11:39:52,369 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-15 11:39:52,370 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-15 11:39:52,371 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-15 11:39:52,371 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-15 11:39:52,371 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-15 11:39:52,371 INFO L290 TraceCheckUtils]: 70: Hoare triple {78581#true} assume 4400 == #t~mem52;havoc #t~mem52; {78581#true} is VALID [2022-04-15 11:39:52,371 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-15 11:39:52,371 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-15 11:39:52,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {78581#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {78581#true} is VALID [2022-04-15 11:39:52,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {78581#true} assume !(~ret~0 <= 0); {78581#true} is VALID [2022-04-15 11:39:52,371 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-15 11:39:52,371 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-15 11:39:52,371 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-15 11:39:52,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-15 11:39:52,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,376 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-15 11:39:52,377 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-15 11:39:52,377 INFO L290 TraceCheckUtils]: 92: Hoare triple {78581#true} assume 4416 == #t~mem54;havoc #t~mem54; {78581#true} is VALID [2022-04-15 11:39:52,377 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-15 11:39:52,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {78581#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {78581#true} is VALID [2022-04-15 11:39:52,381 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-15 11:39:52,382 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-15 11:39:52,382 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-15 11:39:52,382 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-15 11:39:52,383 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-15 11:39:52,383 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-15 11:39:52,383 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-15 11:39:52,384 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-15 11:39:52,384 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-15 11:39:52,384 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-15 11:39:52,385 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-15 11:39:52,385 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-15 11:39:52,385 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-15 11:39:52,386 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-15 11:39:52,386 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-15 11:39:52,387 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-15 11:39:52,387 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-15 11:39:52,387 INFO L290 TraceCheckUtils]: 112: Hoare triple {78582#false} assume !(1 == ~blastFlag~0); {78582#false} is VALID [2022-04-15 11:39:52,387 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-15 11:39:52,387 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-15 11:39:52,387 INFO L290 TraceCheckUtils]: 115: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-15 11:39:52,387 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-15 11:39:52,387 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-15 11:39:52,387 INFO L290 TraceCheckUtils]: 118: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-15 11:39:52,387 INFO L290 TraceCheckUtils]: 119: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-15 11:39:52,387 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,388 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-15 11:39:52,389 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-15 11:39:52,389 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-15 11:39:52,389 INFO L290 TraceCheckUtils]: 136: Hoare triple {78582#false} assume 4448 == #t~mem58;havoc #t~mem58; {78582#false} is VALID [2022-04-15 11:39:52,389 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-15 11:39:52,389 INFO L290 TraceCheckUtils]: 138: Hoare triple {78582#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {78582#false} is VALID [2022-04-15 11:39:52,389 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-15 11:39:52,389 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-15 11:39:52,389 INFO L290 TraceCheckUtils]: 141: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-15 11:39:52,389 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-15 11:39:52,389 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-15 11:39:52,389 INFO L290 TraceCheckUtils]: 144: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-15 11:39:52,389 INFO L290 TraceCheckUtils]: 145: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-15 11:39:52,389 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-15 11:39:52,390 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-15 11:39:52,390 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-15 11:39:52,390 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-15 11:39:52,390 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-15 11:39:52,390 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-15 11:39:52,390 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-15 11:39:52,390 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-15 11:39:52,391 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-15 11:39:52,391 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-15 11:39:52,391 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-15 11:39:52,391 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-15 11:39:52,391 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-15 11:39:52,391 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-15 11:39:52,391 INFO L290 TraceCheckUtils]: 160: Hoare triple {78582#false} assume 4432 == #t~mem56;havoc #t~mem56; {78582#false} is VALID [2022-04-15 11:39:52,391 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-15 11:39:52,391 INFO L290 TraceCheckUtils]: 162: Hoare triple {78582#false} assume 5 == ~blastFlag~0; {78582#false} is VALID [2022-04-15 11:39:52,391 INFO L290 TraceCheckUtils]: 163: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-15 11:39:52,394 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-15 11:39:52,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:39:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137239020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:52,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:39:52,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-04-15 11:39:52,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:52,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666346163] [2022-04-15 11:39:52,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666346163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:52,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:52,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:39:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842199294] [2022-04-15 11:39:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:52,395 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-15 11:39:52,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:52,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:52,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:52,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:39:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:52,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:39:52,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:39:52,491 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-15 11:39:58,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:59,417 INFO L93 Difference]: Finished difference Result 1857 states and 2674 transitions. [2022-04-15 11:39:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:39:59,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-15 11:39:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:59,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-15 11:39:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-04-15 11:39:59,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-15 11:39:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-04-15 11:39:59,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 392 transitions. [2022-04-15 11:39:59,701 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-15 11:39:59,742 INFO L225 Difference]: With dead ends: 1857 [2022-04-15 11:39:59,742 INFO L226 Difference]: Without dead ends: 966 [2022-04-15 11:39:59,744 INFO L912 BasicCegarLoop]: 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-15 11:39:59,745 INFO L913 BasicCegarLoop]: 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-15 11:39:59,745 INFO L914 BasicCegarLoop]: 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-15 11:39:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-04-15 11:39:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 907. [2022-04-15 11:39:59,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:59,805 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-15 11:39:59,806 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-15 11:39:59,807 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-15 11:39:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:59,851 INFO L93 Difference]: Finished difference Result 966 states and 1376 transitions. [2022-04-15 11:39:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2022-04-15 11:39:59,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:59,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:59,855 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-15 11:39:59,856 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-15 11:39:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:59,902 INFO L93 Difference]: Finished difference Result 966 states and 1376 transitions. [2022-04-15 11:39:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2022-04-15 11:39:59,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:59,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:59,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:59,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:59,905 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-15 11:39:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1310 transitions. [2022-04-15 11:39:59,965 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1310 transitions. Word has length 164 [2022-04-15 11:39:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:59,965 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1310 transitions. [2022-04-15 11:39:59,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:59,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1310 transitions. [2022-04-15 11:40:01,144 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-15 11:40:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1310 transitions. [2022-04-15 11:40:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-15 11:40:01,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:01,146 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:01,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 11:40:01,346 WARN L460 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-15 11:40:01,347 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1024644139, now seen corresponding path program 1 times [2022-04-15 11:40:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:01,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090896894] [2022-04-15 11:40:13,502 WARN L232 SmtUtils]: Spent 12.15s 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-15 11:40:25,125 WARN L232 SmtUtils]: Spent 7.42s 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-15 11:40:32,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1024644139, now seen corresponding path program 2 times [2022-04-15 11:40:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:32,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132765610] [2022-04-15 11:40:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:32,553 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-15 11:40:32,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {86545#true} assume true; {86545#true} is VALID [2022-04-15 11:40:32,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86545#true} {86545#true} #592#return; {86545#true} is VALID [2022-04-15 11:40:32,555 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-15 11:40:32,555 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-15 11:40:32,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {86545#true} assume true; {86545#true} is VALID [2022-04-15 11:40:32,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86545#true} {86545#true} #592#return; {86545#true} is VALID [2022-04-15 11:40:32,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {86545#true} call #t~ret159 := main(); {86545#true} is VALID [2022-04-15 11:40:32,555 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-15 11:40:32,555 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-15 11:40:32,555 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-15 11:40:32,556 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-15 11:40:32,556 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-15 11:40:32,556 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-15 11:40:32,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-15 11:40:32,556 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-15 11:40:32,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {86545#true} assume 12292 == #t~mem43;havoc #t~mem43; {86545#true} is VALID [2022-04-15 11:40:32,556 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-15 11:40:32,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {86545#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {86545#true} is VALID [2022-04-15 11:40:32,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {86545#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {86545#true} is VALID [2022-04-15 11:40:32,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {86545#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {86545#true} is VALID [2022-04-15 11:40:32,556 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-15 11:40:32,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,557 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-15 11:40:32,558 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-15 11:40:32,558 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-15 11:40:32,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {86545#true} assume 4368 == #t~mem48;havoc #t~mem48; {86545#true} is VALID [2022-04-15 11:40:32,558 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-15 11:40:32,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {86545#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86545#true} is VALID [2022-04-15 11:40:32,558 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-15 11:40:32,558 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-15 11:40:32,558 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-15 11:40:32,558 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-15 11:40:32,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-15 11:40:32,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-15 11:40:32,558 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-15 11:40:32,558 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-15 11:40:32,559 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-15 11:40:32,559 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-15 11:40:32,559 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-15 11:40:32,559 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-15 11:40:32,559 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-15 11:40:32,559 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-15 11:40:32,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {86545#true} assume 4384 == #t~mem50;havoc #t~mem50; {86545#true} is VALID [2022-04-15 11:40:32,559 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-15 11:40:32,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {86545#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86545#true} is VALID [2022-04-15 11:40:32,559 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-15 11:40:32,559 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-15 11:40:32,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {86545#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {86545#true} is VALID [2022-04-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-15 11:40:32,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,560 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-15 11:40:32,561 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-15 11:40:32,561 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-15 11:40:32,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {86545#true} assume 4400 == #t~mem52;havoc #t~mem52; {86545#true} is VALID [2022-04-15 11:40:32,561 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-15 11:40:32,561 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-15 11:40:32,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {86545#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86545#true} is VALID [2022-04-15 11:40:32,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {86545#true} assume !(~ret~0 <= 0); {86545#true} is VALID [2022-04-15 11:40:32,561 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-15 11:40:32,561 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-15 11:40:32,561 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-15 11:40:32,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-15 11:40:32,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,562 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-15 11:40:32,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {86545#true} assume 4416 == #t~mem54;havoc #t~mem54; {86545#true} is VALID [2022-04-15 11:40:32,563 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-15 11:40:32,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {86545#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86545#true} is VALID [2022-04-15 11:40:32,564 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-15 11:40:32,564 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-15 11:40:32,565 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-15 11:40:32,565 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-15 11:40:32,565 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-15 11:40:32,565 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-15 11:40:32,566 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-15 11:40:32,566 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-15 11:40:32,566 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-15 11:40:32,567 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-15 11:40:32,567 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-15 11:40:32,567 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-15 11:40:32,568 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-15 11:40:32,568 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-15 11:40:32,568 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-15 11:40:32,568 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-15 11:40:32,569 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-15 11:40:32,569 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-15 11:40:32,569 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 INFO L290 TraceCheckUtils]: 118: Hoare triple {86546#false} ~skip~0 := 0; {86546#false} is VALID [2022-04-15 11:40:32,570 INFO L290 TraceCheckUtils]: 119: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,570 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 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-15 11:40:32,571 INFO L290 TraceCheckUtils]: 136: Hoare triple {86546#false} assume 4448 == #t~mem58;havoc #t~mem58; {86546#false} is VALID [2022-04-15 11:40:32,571 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-15 11:40:32,571 INFO L290 TraceCheckUtils]: 138: Hoare triple {86546#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86546#false} is VALID [2022-04-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,572 INFO L290 TraceCheckUtils]: 141: Hoare triple {86546#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {86546#false} is VALID [2022-04-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,572 INFO L290 TraceCheckUtils]: 144: Hoare triple {86546#false} ~skip~0 := 0; {86546#false} is VALID [2022-04-15 11:40:32,572 INFO L290 TraceCheckUtils]: 145: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,572 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 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-15 11:40:32,573 INFO L290 TraceCheckUtils]: 160: Hoare triple {86546#false} assume 4432 == #t~mem56;havoc #t~mem56; {86546#false} is VALID [2022-04-15 11:40:32,573 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-15 11:40:32,573 INFO L290 TraceCheckUtils]: 162: Hoare triple {86546#false} assume 5 == ~blastFlag~0; {86546#false} is VALID [2022-04-15 11:40:32,573 INFO L290 TraceCheckUtils]: 163: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-15 11:40:32,574 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-15 11:40:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132765610] [2022-04-15 11:40:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132765610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:32,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:32,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090896894] [2022-04-15 11:40:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090896894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:32,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891381436] [2022-04-15 11:40:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:32,575 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-15 11:40:32,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:32,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:32,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:32,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:32,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:32,676 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-15 11:40:34,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:35,960 INFO L93 Difference]: Finished difference Result 1836 states and 2640 transitions. [2022-04-15 11:40:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:35,961 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-15 11:40:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:40:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:40:35,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-15 11:40:36,236 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-15 11:40:36,271 INFO L225 Difference]: With dead ends: 1836 [2022-04-15 11:40:36,271 INFO L226 Difference]: Without dead ends: 945 [2022-04-15 11:40:36,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:36,273 INFO L913 BasicCegarLoop]: 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-15 11:40:36,273 INFO L914 BasicCegarLoop]: 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-15 11:40:36,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-04-15 11:40:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 907. [2022-04-15 11:40:36,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:36,330 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-15 11:40:36,332 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-15 11:40:36,333 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-15 11:40:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:36,378 INFO L93 Difference]: Finished difference Result 945 states and 1346 transitions. [2022-04-15 11:40:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1346 transitions. [2022-04-15 11:40:36,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:36,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:36,381 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-15 11:40:36,382 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-15 11:40:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:36,425 INFO L93 Difference]: Finished difference Result 945 states and 1346 transitions. [2022-04-15 11:40:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1346 transitions. [2022-04-15 11:40:36,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:36,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:36,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:36,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:36,428 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-15 11:40:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1306 transitions. [2022-04-15 11:40:36,489 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1306 transitions. Word has length 164 [2022-04-15 11:40:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:36,490 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1306 transitions. [2022-04-15 11:40:36,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:36,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1306 transitions. [2022-04-15 11:40:37,723 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-15 11:40:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1306 transitions. [2022-04-15 11:40:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-15 11:40:37,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:37,725 INFO L499 BasicCegarLoop]: 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-15 11:40:37,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:40:37,725 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -225241884, now seen corresponding path program 1 times [2022-04-15 11:40:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:37,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871189626] [2022-04-15 11:40:37,726 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash -225241884, now seen corresponding path program 2 times [2022-04-15 11:40:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:37,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084298280] [2022-04-15 11:40:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:37,957 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-15 11:40:37,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {93933#true} assume true; {93933#true} is VALID [2022-04-15 11:40:37,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93933#true} {93933#true} #592#return; {93933#true} is VALID [2022-04-15 11:40:37,958 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-15 11:40:37,959 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-15 11:40:37,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {93933#true} assume true; {93933#true} is VALID [2022-04-15 11:40:37,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93933#true} {93933#true} #592#return; {93933#true} is VALID [2022-04-15 11:40:37,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {93933#true} call #t~ret159 := main(); {93933#true} is VALID [2022-04-15 11:40:37,959 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-15 11:40:37,959 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-15 11:40:37,959 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-15 11:40:37,959 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-15 11:40:37,959 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-15 11:40:37,959 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-15 11:40:37,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,960 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-15 11:40:37,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {93933#true} assume 12292 == #t~mem43;havoc #t~mem43; {93933#true} is VALID [2022-04-15 11:40:37,960 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-15 11:40:37,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {93933#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {93933#true} is VALID [2022-04-15 11:40:37,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {93933#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {93933#true} is VALID [2022-04-15 11:40:37,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {93933#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {93933#true} is VALID [2022-04-15 11:40:37,960 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-15 11:40:37,960 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-15 11:40:37,960 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-15 11:40:37,960 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-15 11:40:37,960 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-15 11:40:37,960 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-15 11:40:37,961 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-15 11:40:37,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-15 11:40:37,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,961 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-15 11:40:37,961 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-15 11:40:37,961 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-15 11:40:37,961 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-15 11:40:37,961 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-15 11:40:37,961 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-15 11:40:37,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {93933#true} assume 4368 == #t~mem48;havoc #t~mem48; {93933#true} is VALID [2022-04-15 11:40:37,961 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-15 11:40:37,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {93933#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {93933#true} is VALID [2022-04-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-15 11:40:37,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,962 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-15 11:40:37,963 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-15 11:40:37,963 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-15 11:40:37,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {93933#true} assume 4384 == #t~mem50;havoc #t~mem50; {93933#true} is VALID [2022-04-15 11:40:37,963 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-15 11:40:37,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {93933#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {93933#true} is VALID [2022-04-15 11:40:37,963 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-15 11:40:37,963 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-15 11:40:37,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {93933#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-15 11:40:37,963 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-15 11:40:37,963 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-15 11:40:37,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-15 11:40:37,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 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-15 11:40:37,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {93933#true} assume 4400 == #t~mem52;havoc #t~mem52; {93933#true} is VALID [2022-04-15 11:40:37,964 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-15 11:40:37,965 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-15 11:40:37,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {93933#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {93933#true} is VALID [2022-04-15 11:40:37,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {93933#true} assume !(~ret~0 <= 0); {93933#true} is VALID [2022-04-15 11:40:37,965 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-15 11:40:37,965 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-15 11:40:37,965 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-15 11:40:37,965 INFO L290 TraceCheckUtils]: 78: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-15 11:40:37,965 INFO L290 TraceCheckUtils]: 79: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,965 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-15 11:40:37,965 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-15 11:40:37,965 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-15 11:40:37,965 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 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-15 11:40:37,966 INFO L290 TraceCheckUtils]: 92: Hoare triple {93933#true} assume 4416 == #t~mem54;havoc #t~mem54; {93933#true} is VALID [2022-04-15 11:40:37,966 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-15 11:40:37,966 INFO L290 TraceCheckUtils]: 94: Hoare triple {93933#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {93933#true} is VALID [2022-04-15 11:40:37,966 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-15 11:40:37,967 INFO L290 TraceCheckUtils]: 96: Hoare triple {93933#true} assume !(0 == ~tmp___6~0); {93933#true} is VALID [2022-04-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,967 INFO L290 TraceCheckUtils]: 99: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-15 11:40:37,967 INFO L290 TraceCheckUtils]: 100: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,967 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-15 11:40:37,968 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-15 11:40:37,968 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-15 11:40:37,968 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-15 11:40:37,968 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-15 11:40:37,968 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-15 11:40:37,968 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-15 11:40:37,968 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-15 11:40:37,968 INFO L290 TraceCheckUtils]: 115: Hoare triple {93933#true} assume 4432 == #t~mem56;havoc #t~mem56; {93933#true} is VALID [2022-04-15 11:40:37,968 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-15 11:40:37,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {93933#true} assume !(5 == ~blastFlag~0); {93933#true} is VALID [2022-04-15 11:40:37,968 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 INFO L290 TraceCheckUtils]: 121: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-15 11:40:37,969 INFO L290 TraceCheckUtils]: 122: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,969 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 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-15 11:40:37,970 INFO L290 TraceCheckUtils]: 139: Hoare triple {93933#true} assume 4448 == #t~mem58;havoc #t~mem58; {93933#true} is VALID [2022-04-15 11:40:37,970 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-15 11:40:37,970 INFO L290 TraceCheckUtils]: 141: Hoare triple {93933#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {93933#true} is VALID [2022-04-15 11:40:37,970 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-15 11:40:37,971 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-15 11:40:37,972 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-15 11:40:37,973 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-15 11:40:37,973 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-15 11:40:37,973 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-15 11:40:37,973 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-15 11:40:37,974 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-15 11:40:37,974 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-15 11:40:37,974 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-15 11:40:37,975 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-15 11:40:37,975 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-15 11:40:37,975 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-15 11:40:37,975 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-15 11:40:37,976 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-15 11:40:37,976 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-15 11:40:37,976 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-15 11:40:37,977 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-15 11:40:37,977 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-15 11:40:37,977 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-15 11:40:37,978 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-15 11:40:37,978 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-15 11:40:37,978 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-15 11:40:37,978 INFO L290 TraceCheckUtils]: 165: Hoare triple {93934#false} assume 5 == ~blastFlag~0; {93934#false} is VALID [2022-04-15 11:40:37,978 INFO L290 TraceCheckUtils]: 166: Hoare triple {93934#false} assume !false; {93934#false} is VALID [2022-04-15 11:40:37,979 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-15 11:40:37,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084298280] [2022-04-15 11:40:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084298280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:37,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:37,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:37,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871189626] [2022-04-15 11:40:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871189626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:37,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:37,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121906363] [2022-04-15 11:40:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:37,981 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-15 11:40:37,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:37,981 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-15 11:40:38,065 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-15 11:40:38,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:38,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:38,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:38,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:38,067 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-15 11:40:40,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:41,442 INFO L93 Difference]: Finished difference Result 2177 states and 3145 transitions. [2022-04-15 11:40:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:41,442 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-15 11:40:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:41,443 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-15 11:40:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:40:41,445 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-15 11:40:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:40:41,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 11:40:41,781 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-15 11:40:41,855 INFO L225 Difference]: With dead ends: 2177 [2022-04-15 11:40:41,855 INFO L226 Difference]: Without dead ends: 1286 [2022-04-15 11:40:41,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:41,856 INFO L913 BasicCegarLoop]: 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-15 11:40:41,857 INFO L914 BasicCegarLoop]: 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-15 11:40:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-15 11:40:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 952. [2022-04-15 11:40:41,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:41,918 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-15 11:40:41,919 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-15 11:40:41,920 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-15 11:40:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:41,996 INFO L93 Difference]: Finished difference Result 1286 states and 1854 transitions. [2022-04-15 11:40:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1854 transitions. [2022-04-15 11:40:41,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:41,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:42,000 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-15 11:40:42,001 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-15 11:40:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:42,079 INFO L93 Difference]: Finished difference Result 1286 states and 1854 transitions. [2022-04-15 11:40:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1854 transitions. [2022-04-15 11:40:42,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:42,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:42,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:42,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:42,082 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-15 11:40:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1391 transitions. [2022-04-15 11:40:42,130 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1391 transitions. Word has length 167 [2022-04-15 11:40:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:42,131 INFO L478 AbstractCegarLoop]: Abstraction has 952 states and 1391 transitions. [2022-04-15 11:40:42,131 INFO L479 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-15 11:40:42,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 952 states and 1391 transitions. [2022-04-15 11:40:43,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1391 transitions. [2022-04-15 11:40:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-15 11:40:43,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:43,449 INFO L499 BasicCegarLoop]: 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-15 11:40:43,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:40:43,450 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1603018293, now seen corresponding path program 1 times [2022-04-15 11:40:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:43,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560656451] [2022-04-15 11:40:43,451 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1603018293, now seen corresponding path program 2 times [2022-04-15 11:40:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155644476] [2022-04-15 11:40:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:43,664 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-15 11:40:43,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {102775#true} assume true; {102775#true} is VALID [2022-04-15 11:40:43,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102775#true} {102775#true} #592#return; {102775#true} is VALID [2022-04-15 11:40:43,665 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-15 11:40:43,665 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-15 11:40:43,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {102775#true} assume true; {102775#true} is VALID [2022-04-15 11:40:43,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102775#true} {102775#true} #592#return; {102775#true} is VALID [2022-04-15 11:40:43,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {102775#true} call #t~ret159 := main(); {102775#true} is VALID [2022-04-15 11:40:43,665 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-15 11:40:43,665 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-15 11:40:43,665 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-15 11:40:43,666 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-15 11:40:43,666 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-15 11:40:43,666 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-15 11:40:43,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,666 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-15 11:40:43,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {102775#true} assume 12292 == #t~mem43;havoc #t~mem43; {102775#true} is VALID [2022-04-15 11:40:43,666 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-15 11:40:43,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {102775#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102775#true} is VALID [2022-04-15 11:40:43,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {102775#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102775#true} is VALID [2022-04-15 11:40:43,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {102775#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {102775#true} is VALID [2022-04-15 11:40:43,666 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-15 11:40:43,666 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-15 11:40:43,666 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-15 11:40:43,666 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-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-15 11:40:43,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,667 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-15 11:40:43,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {102775#true} assume 4368 == #t~mem48;havoc #t~mem48; {102775#true} is VALID [2022-04-15 11:40:43,668 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-15 11:40:43,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {102775#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102775#true} is VALID [2022-04-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-15 11:40:43,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,668 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-15 11:40:43,669 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-15 11:40:43,669 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-15 11:40:43,669 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-15 11:40:43,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {102775#true} assume 4384 == #t~mem50;havoc #t~mem50; {102775#true} is VALID [2022-04-15 11:40:43,669 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-15 11:40:43,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {102775#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102775#true} is VALID [2022-04-15 11:40:43,669 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-15 11:40:43,669 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-15 11:40:43,669 INFO L290 TraceCheckUtils]: 55: Hoare triple {102775#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-15 11:40:43,669 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-15 11:40:43,669 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-15 11:40:43,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-15 11:40:43,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {102775#true} assume 4400 == #t~mem52;havoc #t~mem52; {102775#true} is VALID [2022-04-15 11:40:43,670 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-15 11:40:43,670 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-15 11:40:43,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {102775#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102775#true} is VALID [2022-04-15 11:40:43,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {102775#true} assume !(~ret~0 <= 0); {102775#true} is VALID [2022-04-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-15 11:40:43,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,671 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-15 11:40:43,672 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-15 11:40:43,672 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-15 11:40:43,672 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-15 11:40:43,672 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-15 11:40:43,672 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-15 11:40:43,672 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-15 11:40:43,672 INFO L290 TraceCheckUtils]: 92: Hoare triple {102775#true} assume 4416 == #t~mem54;havoc #t~mem54; {102775#true} is VALID [2022-04-15 11:40:43,672 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-15 11:40:43,672 INFO L290 TraceCheckUtils]: 94: Hoare triple {102775#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102775#true} is VALID [2022-04-15 11:40:43,672 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-15 11:40:43,672 INFO L290 TraceCheckUtils]: 96: Hoare triple {102775#true} assume !(0 == ~tmp___6~0); {102775#true} is VALID [2022-04-15 11:40:43,672 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-15 11:40:43,672 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-15 11:40:43,673 INFO L290 TraceCheckUtils]: 99: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-15 11:40:43,673 INFO L290 TraceCheckUtils]: 100: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,673 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-15 11:40:43,674 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-15 11:40:43,674 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-15 11:40:43,674 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-15 11:40:43,674 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-15 11:40:43,674 INFO L290 TraceCheckUtils]: 115: Hoare triple {102775#true} assume 4432 == #t~mem56;havoc #t~mem56; {102775#true} is VALID [2022-04-15 11:40:43,674 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-15 11:40:43,674 INFO L290 TraceCheckUtils]: 117: Hoare triple {102775#true} assume !(5 == ~blastFlag~0); {102775#true} is VALID [2022-04-15 11:40:43,674 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-15 11:40:43,674 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-15 11:40:43,674 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-15 11:40:43,674 INFO L290 TraceCheckUtils]: 121: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-15 11:40:43,674 INFO L290 TraceCheckUtils]: 122: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-15 11:40:43,674 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,675 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-15 11:40:43,676 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-15 11:40:43,676 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-15 11:40:43,676 INFO L290 TraceCheckUtils]: 139: Hoare triple {102775#true} assume 4448 == #t~mem58;havoc #t~mem58; {102775#true} is VALID [2022-04-15 11:40:43,676 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-15 11:40:43,676 INFO L290 TraceCheckUtils]: 141: Hoare triple {102775#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102775#true} is VALID [2022-04-15 11:40:43,676 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-15 11:40:43,677 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-15 11:40:43,677 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-15 11:40:43,678 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-15 11:40:43,678 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-15 11:40:43,679 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-15 11:40:43,679 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-15 11:40:43,679 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-15 11:40:43,680 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-15 11:40:43,680 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-15 11:40:43,681 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-15 11:40:43,681 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-15 11:40:43,681 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-15 11:40:43,682 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-15 11:40:43,682 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-15 11:40:43,683 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-15 11:40:43,683 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-15 11:40:43,683 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-15 11:40:43,684 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-15 11:40:43,684 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-15 11:40:43,684 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-15 11:40:43,685 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-15 11:40:43,685 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-15 11:40:43,685 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-15 11:40:43,685 INFO L290 TraceCheckUtils]: 166: Hoare triple {102776#false} assume 5 == ~blastFlag~0; {102776#false} is VALID [2022-04-15 11:40:43,685 INFO L290 TraceCheckUtils]: 167: Hoare triple {102776#false} assume !false; {102776#false} is VALID [2022-04-15 11:40:43,686 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-15 11:40:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:43,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155644476] [2022-04-15 11:40:43,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155644476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:43,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:43,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:43,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560656451] [2022-04-15 11:40:43,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560656451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:43,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:43,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74493561] [2022-04-15 11:40:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:43,688 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-15 11:40:43,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:43,688 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-15 11:40:43,764 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-15 11:40:43,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:43,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:43,765 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-15 11:40:45,788 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:47,094 INFO L93 Difference]: Finished difference Result 2219 states and 3222 transitions. [2022-04-15 11:40:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:47,094 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-15 11:40:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:47,095 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-15 11:40:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:40:47,107 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-15 11:40:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:40:47,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 11:40:47,431 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-15 11:40:47,496 INFO L225 Difference]: With dead ends: 2219 [2022-04-15 11:40:47,496 INFO L226 Difference]: Without dead ends: 1283 [2022-04-15 11:40:47,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:47,498 INFO L913 BasicCegarLoop]: 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-15 11:40:47,498 INFO L914 BasicCegarLoop]: 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-15 11:40:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-04-15 11:40:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 957. [2022-04-15 11:40:47,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:47,552 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-15 11:40:47,553 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-15 11:40:47,554 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-15 11:40:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:47,606 INFO L93 Difference]: Finished difference Result 1283 states and 1846 transitions. [2022-04-15 11:40:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1846 transitions. [2022-04-15 11:40:47,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:47,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:47,609 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-15 11:40:47,609 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-15 11:40:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:47,671 INFO L93 Difference]: Finished difference Result 1283 states and 1846 transitions. [2022-04-15 11:40:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1846 transitions. [2022-04-15 11:40:47,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:47,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:47,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:47,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:47,674 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-15 11:40:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1396 transitions. [2022-04-15 11:40:47,715 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1396 transitions. Word has length 168 [2022-04-15 11:40:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:47,715 INFO L478 AbstractCegarLoop]: Abstraction has 957 states and 1396 transitions. [2022-04-15 11:40:47,715 INFO L479 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-15 11:40:47,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1396 transitions. [2022-04-15 11:40:49,057 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-15 11:40:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1396 transitions. [2022-04-15 11:40:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-15 11:40:49,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:49,059 INFO L499 BasicCegarLoop]: 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-15 11:40:49,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:40:49,059 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 908405628, now seen corresponding path program 1 times [2022-04-15 11:40:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:49,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449619608] [2022-04-15 11:41:05,736 WARN L232 SmtUtils]: Spent 16.26s 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-15 11:41:17,471 WARN L232 SmtUtils]: Spent 7.57s 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-15 11:41:24,442 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:41:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 908405628, now seen corresponding path program 2 times [2022-04-15 11:41:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:24,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739623339] [2022-04-15 11:41:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:24,657 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-15 11:41:24,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {111705#true} assume true; {111705#true} is VALID [2022-04-15 11:41:24,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111705#true} {111705#true} #592#return; {111705#true} is VALID [2022-04-15 11:41:24,658 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-15 11:41:24,659 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-15 11:41:24,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {111705#true} assume true; {111705#true} is VALID [2022-04-15 11:41:24,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111705#true} {111705#true} #592#return; {111705#true} is VALID [2022-04-15 11:41:24,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {111705#true} call #t~ret159 := main(); {111705#true} is VALID [2022-04-15 11:41:24,659 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-15 11:41:24,659 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-15 11:41:24,659 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-15 11:41:24,659 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-15 11:41:24,659 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-15 11:41:24,659 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-15 11:41:24,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,659 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-15 11:41:24,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#true} assume 12292 == #t~mem43;havoc #t~mem43; {111705#true} is VALID [2022-04-15 11:41:24,660 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-15 11:41:24,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {111705#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {111705#true} is VALID [2022-04-15 11:41:24,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {111705#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {111705#true} is VALID [2022-04-15 11:41:24,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {111705#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {111705#true} is VALID [2022-04-15 11:41:24,660 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-15 11:41:24,660 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-15 11:41:24,660 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-15 11:41:24,660 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-15 11:41:24,660 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-15 11:41:24,660 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-15 11:41:24,660 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-15 11:41:24,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-15 11:41:24,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,661 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-15 11:41:24,661 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-15 11:41:24,661 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-15 11:41:24,661 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-15 11:41:24,661 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-15 11:41:24,661 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-15 11:41:24,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {111705#true} assume 4368 == #t~mem48;havoc #t~mem48; {111705#true} is VALID [2022-04-15 11:41:24,661 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-15 11:41:24,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {111705#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {111705#true} is VALID [2022-04-15 11:41:24,661 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-15 11:41:24,661 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-15 11:41:24,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 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-15 11:41:24,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {111705#true} assume 4384 == #t~mem50;havoc #t~mem50; {111705#true} is VALID [2022-04-15 11:41:24,663 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-15 11:41:24,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {111705#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {111705#true} is VALID [2022-04-15 11:41:24,663 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-15 11:41:24,663 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-15 11:41:24,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {111705#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-15 11:41:24,663 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-15 11:41:24,663 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-15 11:41:24,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-15 11:41:24,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,663 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-15 11:41:24,663 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-15 11:41:24,663 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-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {111705#true} assume 4400 == #t~mem52;havoc #t~mem52; {111705#true} is VALID [2022-04-15 11:41:24,664 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-15 11:41:24,664 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-15 11:41:24,664 INFO L290 TraceCheckUtils]: 73: Hoare triple {111705#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {111705#true} is VALID [2022-04-15 11:41:24,664 INFO L290 TraceCheckUtils]: 74: Hoare triple {111705#true} assume !(~ret~0 <= 0); {111705#true} is VALID [2022-04-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-15 11:41:24,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,665 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-15 11:41:24,666 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-15 11:41:24,666 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-15 11:41:24,666 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-15 11:41:24,666 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-15 11:41:24,666 INFO L290 TraceCheckUtils]: 92: Hoare triple {111705#true} assume 4416 == #t~mem54;havoc #t~mem54; {111705#true} is VALID [2022-04-15 11:41:24,666 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-15 11:41:24,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {111705#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {111705#true} is VALID [2022-04-15 11:41:24,666 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-15 11:41:24,666 INFO L290 TraceCheckUtils]: 96: Hoare triple {111705#true} assume !(0 == ~tmp___6~0); {111705#true} is VALID [2022-04-15 11:41:24,666 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-15 11:41:24,666 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-15 11:41:24,666 INFO L290 TraceCheckUtils]: 99: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-15 11:41:24,667 INFO L290 TraceCheckUtils]: 100: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,667 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-15 11:41:24,668 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-15 11:41:24,668 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-15 11:41:24,668 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-15 11:41:24,668 INFO L290 TraceCheckUtils]: 115: Hoare triple {111705#true} assume 4432 == #t~mem56;havoc #t~mem56; {111705#true} is VALID [2022-04-15 11:41:24,668 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-15 11:41:24,668 INFO L290 TraceCheckUtils]: 117: Hoare triple {111705#true} assume !(5 == ~blastFlag~0); {111705#true} is VALID [2022-04-15 11:41:24,668 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-15 11:41:24,668 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-15 11:41:24,668 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-15 11:41:24,668 INFO L290 TraceCheckUtils]: 121: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-15 11:41:24,668 INFO L290 TraceCheckUtils]: 122: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-15 11:41:24,668 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,669 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-15 11:41:24,670 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-15 11:41:24,670 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-15 11:41:24,670 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-15 11:41:24,670 INFO L290 TraceCheckUtils]: 139: Hoare triple {111705#true} assume 4448 == #t~mem58;havoc #t~mem58; {111705#true} is VALID [2022-04-15 11:41:24,670 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-15 11:41:24,670 INFO L290 TraceCheckUtils]: 141: Hoare triple {111705#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {111705#true} is VALID [2022-04-15 11:41:24,670 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-15 11:41:24,671 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-15 11:41:24,672 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-15 11:41:24,672 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-15 11:41:24,673 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-15 11:41:24,673 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-15 11:41:24,673 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-15 11:41:24,674 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-15 11:41:24,674 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-15 11:41:24,675 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-15 11:41:24,675 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-15 11:41:24,675 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-15 11:41:24,676 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-15 11:41:24,676 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-15 11:41:24,677 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-15 11:41:24,677 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-15 11:41:24,677 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-15 11:41:24,678 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-15 11:41:24,678 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-15 11:41:24,679 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-15 11:41:24,679 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-15 11:41:24,679 INFO L290 TraceCheckUtils]: 163: Hoare triple {111706#false} assume !(3 == ~blastFlag~0); {111706#false} is VALID [2022-04-15 11:41:24,679 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-15 11:41:24,679 INFO L290 TraceCheckUtils]: 165: Hoare triple {111706#false} assume !(0 == ~tmp___6~0); {111706#false} is VALID [2022-04-15 11:41:24,679 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-15 11:41:24,679 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-15 11:41:24,679 INFO L290 TraceCheckUtils]: 168: Hoare triple {111706#false} ~skip~0 := 0; {111706#false} is VALID [2022-04-15 11:41:24,679 INFO L290 TraceCheckUtils]: 169: Hoare triple {111706#false} assume !false; {111706#false} is VALID [2022-04-15 11:41:24,679 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-15 11:41:24,679 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,680 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-15 11:41:24,681 INFO L290 TraceCheckUtils]: 184: Hoare triple {111706#false} assume 4432 == #t~mem56;havoc #t~mem56; {111706#false} is VALID [2022-04-15 11:41:24,681 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-15 11:41:24,681 INFO L290 TraceCheckUtils]: 186: Hoare triple {111706#false} assume 5 == ~blastFlag~0; {111706#false} is VALID [2022-04-15 11:41:24,681 INFO L290 TraceCheckUtils]: 187: Hoare triple {111706#false} assume !false; {111706#false} is VALID [2022-04-15 11:41:24,681 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-15 11:41:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739623339] [2022-04-15 11:41:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739623339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:24,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:24,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449619608] [2022-04-15 11:41:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449619608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:24,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34858990] [2022-04-15 11:41:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:24,683 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-15 11:41:24,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:24,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:24,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:24,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:41:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:41:24,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:41:24,787 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-15 11:41:26,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:41:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:28,644 INFO L93 Difference]: Finished difference Result 2253 states and 3280 transitions. [2022-04-15 11:41:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:41:28,645 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-15 11:41:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-15 11:41:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-15 11:41:28,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-15 11:41:28,960 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-15 11:41:29,022 INFO L225 Difference]: With dead ends: 2253 [2022-04-15 11:41:29,022 INFO L226 Difference]: Without dead ends: 1312 [2022-04-15 11:41:29,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:41:29,023 INFO L913 BasicCegarLoop]: 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:29,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 566 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 536 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 11:41:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-04-15 11:41:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1049. [2022-04-15 11:41:29,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:29,101 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-15 11:41:29,101 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-15 11:41:29,102 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-15 11:41:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:29,151 INFO L93 Difference]: Finished difference Result 1312 states and 1900 transitions. [2022-04-15 11:41:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1900 transitions. [2022-04-15 11:41:29,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:29,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:29,153 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-15 11:41:29,154 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-15 11:41:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:29,203 INFO L93 Difference]: Finished difference Result 1312 states and 1900 transitions. [2022-04-15 11:41:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1900 transitions. [2022-04-15 11:41:29,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:29,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:29,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:29,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:29,206 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-15 11:41:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1532 transitions. [2022-04-15 11:41:29,261 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1532 transitions. Word has length 188 [2022-04-15 11:41:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:29,261 INFO L478 AbstractCegarLoop]: Abstraction has 1049 states and 1532 transitions. [2022-04-15 11:41:29,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:29,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1049 states and 1532 transitions. [2022-04-15 11:41:30,754 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-15 11:41:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1532 transitions. [2022-04-15 11:41:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-15 11:41:30,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:30,756 INFO L499 BasicCegarLoop]: 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-15 11:41:30,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:41:30,757 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1801891966, now seen corresponding path program 1 times [2022-04-15 11:41:30,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:30,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456912189] [2022-04-15 11:41:42,741 WARN L232 SmtUtils]: Spent 11.57s 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-15 11:41:50,439 WARN L232 SmtUtils]: Spent 5.14s 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-15 11:41:57,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:41:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1801891966, now seen corresponding path program 2 times [2022-04-15 11:41:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:57,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974568520] [2022-04-15 11:41:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:57,944 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-15 11:41:57,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {120945#true} assume true; {120945#true} is VALID [2022-04-15 11:41:57,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120945#true} {120945#true} #592#return; {120945#true} is VALID [2022-04-15 11:41:57,945 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-15 11:41:57,945 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-15 11:41:57,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {120945#true} assume true; {120945#true} is VALID [2022-04-15 11:41:57,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120945#true} {120945#true} #592#return; {120945#true} is VALID [2022-04-15 11:41:57,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {120945#true} call #t~ret159 := main(); {120945#true} is VALID [2022-04-15 11:41:57,946 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-15 11:41:57,946 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-15 11:41:57,946 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-15 11:41:57,946 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-15 11:41:57,946 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-15 11:41:57,946 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-15 11:41:57,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,946 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-15 11:41:57,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {120945#true} assume 12292 == #t~mem43;havoc #t~mem43; {120945#true} is VALID [2022-04-15 11:41:57,947 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-15 11:41:57,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {120945#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {120945#true} is VALID [2022-04-15 11:41:57,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {120945#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {120945#true} is VALID [2022-04-15 11:41:57,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {120945#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {120945#true} is VALID [2022-04-15 11:41:57,947 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-15 11:41:57,947 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-15 11:41:57,947 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-15 11:41:57,947 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-15 11:41:57,947 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-15 11:41:57,948 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-15 11:41:57,948 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-15 11:41:57,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-15 11:41:57,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,948 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-15 11:41:57,948 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-15 11:41:57,948 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-15 11:41:57,948 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-15 11:41:57,948 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-15 11:41:57,948 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-15 11:41:57,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {120945#true} assume 4368 == #t~mem48;havoc #t~mem48; {120945#true} is VALID [2022-04-15 11:41:57,949 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-15 11:41:57,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {120945#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {120945#true} is VALID [2022-04-15 11:41:57,949 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-15 11:41:57,949 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-15 11:41:57,949 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-15 11:41:57,949 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-15 11:41:57,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-15 11:41:57,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,949 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-15 11:41:57,950 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-15 11:41:57,950 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-15 11:41:57,950 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-15 11:41:57,950 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-15 11:41:57,950 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-15 11:41:57,950 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-15 11:41:57,950 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-15 11:41:57,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {120945#true} assume 4384 == #t~mem50;havoc #t~mem50; {120945#true} is VALID [2022-04-15 11:41:57,950 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-15 11:41:57,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {120945#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {120945#true} is VALID [2022-04-15 11:41:57,950 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-15 11:41:57,951 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-15 11:41:57,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {120945#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-15 11:41:57,951 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-15 11:41:57,951 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-15 11:41:57,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-15 11:41:57,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,951 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-15 11:41:57,951 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-15 11:41:57,951 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-15 11:41:57,951 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-15 11:41:57,951 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-15 11:41:57,951 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-15 11:41:57,952 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-15 11:41:57,952 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-15 11:41:57,952 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-15 11:41:57,952 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-15 11:41:57,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {120945#true} assume 4400 == #t~mem52;havoc #t~mem52; {120945#true} is VALID [2022-04-15 11:41:57,952 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-15 11:41:57,952 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-15 11:41:57,952 INFO L290 TraceCheckUtils]: 73: Hoare triple {120945#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {120945#true} is VALID [2022-04-15 11:41:57,952 INFO L290 TraceCheckUtils]: 74: Hoare triple {120945#true} assume !(~ret~0 <= 0); {120945#true} is VALID [2022-04-15 11:41:57,952 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-15 11:41:57,952 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-15 11:41:57,952 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-15 11:41:57,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-15 11:41:57,953 INFO L290 TraceCheckUtils]: 79: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,953 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-15 11:41:57,954 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-15 11:41:57,954 INFO L290 TraceCheckUtils]: 92: Hoare triple {120945#true} assume 4416 == #t~mem54;havoc #t~mem54; {120945#true} is VALID [2022-04-15 11:41:57,954 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-15 11:41:57,954 INFO L290 TraceCheckUtils]: 94: Hoare triple {120945#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {120945#true} is VALID [2022-04-15 11:41:57,954 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-15 11:41:57,954 INFO L290 TraceCheckUtils]: 96: Hoare triple {120945#true} assume !(0 == ~tmp___6~0); {120945#true} is VALID [2022-04-15 11:41:57,954 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-15 11:41:57,954 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-15 11:41:57,954 INFO L290 TraceCheckUtils]: 99: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-15 11:41:57,954 INFO L290 TraceCheckUtils]: 100: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,954 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,955 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-15 11:41:57,956 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-15 11:41:57,956 INFO L290 TraceCheckUtils]: 115: Hoare triple {120945#true} assume 4432 == #t~mem56;havoc #t~mem56; {120945#true} is VALID [2022-04-15 11:41:57,956 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-15 11:41:57,956 INFO L290 TraceCheckUtils]: 117: Hoare triple {120945#true} assume !(5 == ~blastFlag~0); {120945#true} is VALID [2022-04-15 11:41:57,956 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-15 11:41:57,956 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-15 11:41:57,956 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-15 11:41:57,956 INFO L290 TraceCheckUtils]: 121: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-15 11:41:57,956 INFO L290 TraceCheckUtils]: 122: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-15 11:41:57,956 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-15 11:41:57,956 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,957 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-15 11:41:57,958 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-15 11:41:57,958 INFO L290 TraceCheckUtils]: 139: Hoare triple {120945#true} assume 4448 == #t~mem58;havoc #t~mem58; {120945#true} is VALID [2022-04-15 11:41:57,958 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-15 11:41:57,958 INFO L290 TraceCheckUtils]: 141: Hoare triple {120945#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {120945#true} is VALID [2022-04-15 11:41:57,958 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-15 11:41:57,959 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-15 11:41:57,960 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-15 11:41:57,960 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-15 11:41:57,961 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-15 11:41:57,961 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-15 11:41:57,961 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-15 11:41:57,962 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-15 11:41:57,962 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-15 11:41:57,963 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-15 11:41:57,963 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-15 11:41:57,963 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-15 11:41:57,964 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-15 11:41:57,964 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-15 11:41:57,965 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-15 11:41:57,965 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-15 11:41:57,965 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-15 11:41:57,966 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-15 11:41:57,966 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-15 11:41:57,966 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-15 11:41:57,967 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-15 11:41:57,967 INFO L290 TraceCheckUtils]: 163: Hoare triple {120946#false} assume !(3 == ~blastFlag~0); {120946#false} is VALID [2022-04-15 11:41:57,967 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-15 11:41:57,967 INFO L290 TraceCheckUtils]: 165: Hoare triple {120946#false} assume !(0 == ~tmp___6~0); {120946#false} is VALID [2022-04-15 11:41:57,967 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-15 11:41:57,967 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-15 11:41:57,967 INFO L290 TraceCheckUtils]: 168: Hoare triple {120946#false} ~skip~0 := 0; {120946#false} is VALID [2022-04-15 11:41:57,967 INFO L290 TraceCheckUtils]: 169: Hoare triple {120946#false} assume !false; {120946#false} is VALID [2022-04-15 11:41:57,967 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-15 11:41:57,967 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-15 11:41:57,967 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-15 11:41:57,967 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 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-15 11:41:57,968 INFO L290 TraceCheckUtils]: 184: Hoare triple {120946#false} assume 4432 == #t~mem56;havoc #t~mem56; {120946#false} is VALID [2022-04-15 11:41:57,968 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-15 11:41:57,969 INFO L290 TraceCheckUtils]: 186: Hoare triple {120946#false} assume 5 == ~blastFlag~0; {120946#false} is VALID [2022-04-15 11:41:57,969 INFO L290 TraceCheckUtils]: 187: Hoare triple {120946#false} assume !false; {120946#false} is VALID [2022-04-15 11:41:57,969 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-15 11:41:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:57,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974568520] [2022-04-15 11:41:57,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974568520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:57,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:57,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:57,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:57,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456912189] [2022-04-15 11:41:57,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456912189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:57,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:57,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644468832] [2022-04-15 11:41:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:57,971 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-15 11:41:57,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:57,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:58,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:58,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:41:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:41:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:41:58,073 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-15 11:42:00,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:01,455 INFO L93 Difference]: Finished difference Result 2533 states and 3684 transitions. [2022-04-15 11:42:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:01,456 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-15 11:42:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:42:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:42:01,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-15 11:42:01,790 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-15 11:42:01,871 INFO L225 Difference]: With dead ends: 2533 [2022-04-15 11:42:01,872 INFO L226 Difference]: Without dead ends: 1500 [2022-04-15 11:42:01,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:01,873 INFO L913 BasicCegarLoop]: 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-15 11:42:01,873 INFO L914 BasicCegarLoop]: 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-15 11:42:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2022-04-15 11:42:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1067. [2022-04-15 11:42:01,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:01,950 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-15 11:42:01,950 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-15 11:42:01,951 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-15 11:42:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:02,013 INFO L93 Difference]: Finished difference Result 1500 states and 2163 transitions. [2022-04-15 11:42:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2163 transitions. [2022-04-15 11:42:02,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:02,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:02,015 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-15 11:42:02,016 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-15 11:42:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:02,079 INFO L93 Difference]: Finished difference Result 1500 states and 2163 transitions. [2022-04-15 11:42:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2163 transitions. [2022-04-15 11:42:02,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:02,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:02,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:02,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:02,082 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-15 11:42:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1557 transitions. [2022-04-15 11:42:02,132 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1557 transitions. Word has length 188 [2022-04-15 11:42:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:02,132 INFO L478 AbstractCegarLoop]: Abstraction has 1067 states and 1557 transitions. [2022-04-15 11:42:02,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:02,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1557 transitions. [2022-04-15 11:42:03,742 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-15 11:42:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1557 transitions. [2022-04-15 11:42:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-15 11:42:03,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:03,744 INFO L499 BasicCegarLoop]: 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-15 11:42:03,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:42:03,744 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1954262571, now seen corresponding path program 1 times [2022-04-15 11:42:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:03,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826778605] [2022-04-15 11:42:14,844 WARN L232 SmtUtils]: Spent 10.71s 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-15 11:42:24,820 WARN L232 SmtUtils]: Spent 6.49s 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-15 11:42:31,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1954262571, now seen corresponding path program 2 times [2022-04-15 11:42:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:31,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738843951] [2022-04-15 11:42:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:32,188 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-15 11:42:32,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {131157#true} assume true; {131157#true} is VALID [2022-04-15 11:42:32,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131157#true} {131157#true} #592#return; {131157#true} is VALID [2022-04-15 11:42:32,190 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-15 11:42:32,190 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-15 11:42:32,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {131157#true} assume true; {131157#true} is VALID [2022-04-15 11:42:32,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131157#true} {131157#true} #592#return; {131157#true} is VALID [2022-04-15 11:42:32,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {131157#true} call #t~ret159 := main(); {131157#true} is VALID [2022-04-15 11:42:32,190 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-15 11:42:32,190 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-15 11:42:32,190 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-15 11:42:32,191 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-15 11:42:32,191 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-15 11:42:32,191 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-15 11:42:32,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,191 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-15 11:42:32,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {131157#true} assume 12292 == #t~mem43;havoc #t~mem43; {131157#true} is VALID [2022-04-15 11:42:32,191 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-15 11:42:32,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {131157#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {131157#true} is VALID [2022-04-15 11:42:32,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {131157#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {131157#true} is VALID [2022-04-15 11:42:32,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {131157#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {131157#true} is VALID [2022-04-15 11:42:32,191 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-15 11:42:32,191 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-15 11:42:32,191 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-15 11:42:32,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 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-15 11:42:32,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {131157#true} assume 4368 == #t~mem48;havoc #t~mem48; {131157#true} is VALID [2022-04-15 11:42:32,193 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-15 11:42:32,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {131157#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {131157#true} is VALID [2022-04-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-15 11:42:32,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,193 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-15 11:42:32,194 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-15 11:42:32,194 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-15 11:42:32,194 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-15 11:42:32,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {131157#true} assume 4384 == #t~mem50;havoc #t~mem50; {131157#true} is VALID [2022-04-15 11:42:32,194 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-15 11:42:32,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {131157#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {131157#true} is VALID [2022-04-15 11:42:32,194 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-15 11:42:32,194 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-15 11:42:32,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {131157#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-15 11:42:32,194 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-15 11:42:32,194 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-15 11:42:32,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-15 11:42:32,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,195 INFO L290 TraceCheckUtils]: 70: Hoare triple {131157#true} assume 4400 == #t~mem52;havoc #t~mem52; {131157#true} is VALID [2022-04-15 11:42:32,195 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-15 11:42:32,195 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-15 11:42:32,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {131157#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {131157#true} is VALID [2022-04-15 11:42:32,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {131157#true} assume !(~ret~0 <= 0); {131157#true} is VALID [2022-04-15 11:42:32,196 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-15 11:42:32,196 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-15 11:42:32,196 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-15 11:42:32,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-15 11:42:32,196 INFO L290 TraceCheckUtils]: 79: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,196 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-15 11:42:32,196 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-15 11:42:32,196 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-15 11:42:32,196 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-15 11:42:32,196 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-15 11:42:32,197 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-15 11:42:32,197 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-15 11:42:32,197 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-15 11:42:32,197 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-15 11:42:32,197 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-15 11:42:32,197 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-15 11:42:32,197 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-15 11:42:32,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {131157#true} assume 4416 == #t~mem54;havoc #t~mem54; {131157#true} is VALID [2022-04-15 11:42:32,197 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-15 11:42:32,197 INFO L290 TraceCheckUtils]: 94: Hoare triple {131157#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {131157#true} is VALID [2022-04-15 11:42:32,197 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-15 11:42:32,197 INFO L290 TraceCheckUtils]: 96: Hoare triple {131157#true} assume !(0 == ~tmp___6~0); {131157#true} is VALID [2022-04-15 11:42:32,197 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-15 11:42:32,198 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-15 11:42:32,198 INFO L290 TraceCheckUtils]: 99: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-15 11:42:32,198 INFO L290 TraceCheckUtils]: 100: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,198 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-15 11:42:32,199 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-15 11:42:32,199 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-15 11:42:32,199 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-15 11:42:32,199 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-15 11:42:32,199 INFO L290 TraceCheckUtils]: 115: Hoare triple {131157#true} assume 4432 == #t~mem56;havoc #t~mem56; {131157#true} is VALID [2022-04-15 11:42:32,199 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-15 11:42:32,199 INFO L290 TraceCheckUtils]: 117: Hoare triple {131157#true} assume !(5 == ~blastFlag~0); {131157#true} is VALID [2022-04-15 11:42:32,199 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-15 11:42:32,199 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-15 11:42:32,199 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-15 11:42:32,199 INFO L290 TraceCheckUtils]: 121: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-15 11:42:32,199 INFO L290 TraceCheckUtils]: 122: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-15 11:42:32,199 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,200 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-15 11:42:32,201 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-15 11:42:32,201 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-15 11:42:32,201 INFO L290 TraceCheckUtils]: 139: Hoare triple {131157#true} assume 4448 == #t~mem58;havoc #t~mem58; {131157#true} is VALID [2022-04-15 11:42:32,201 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-15 11:42:32,201 INFO L290 TraceCheckUtils]: 141: Hoare triple {131157#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {131157#true} is VALID [2022-04-15 11:42:32,201 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-15 11:42:32,202 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-15 11:42:32,203 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-15 11:42:32,203 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-15 11:42:32,204 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-15 11:42:32,204 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-15 11:42:32,204 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-15 11:42:32,205 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-15 11:42:32,205 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-15 11:42:32,206 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-15 11:42:32,206 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-15 11:42:32,206 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-15 11:42:32,207 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-15 11:42:32,207 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-15 11:42:32,207 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-15 11:42:32,208 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-15 11:42:32,208 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-15 11:42:32,209 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-15 11:42:32,209 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-15 11:42:32,209 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-15 11:42:32,210 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-15 11:42:32,210 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-15 11:42:32,210 INFO L290 TraceCheckUtils]: 164: Hoare triple {131158#false} assume !(3 == ~blastFlag~0); {131158#false} is VALID [2022-04-15 11:42:32,210 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-15 11:42:32,210 INFO L290 TraceCheckUtils]: 166: Hoare triple {131158#false} assume !(0 == ~tmp___6~0); {131158#false} is VALID [2022-04-15 11:42:32,210 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-15 11:42:32,210 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-15 11:42:32,210 INFO L290 TraceCheckUtils]: 169: Hoare triple {131158#false} ~skip~0 := 0; {131158#false} is VALID [2022-04-15 11:42:32,210 INFO L290 TraceCheckUtils]: 170: Hoare triple {131158#false} assume !false; {131158#false} is VALID [2022-04-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,211 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-15 11:42:32,212 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-15 11:42:32,212 INFO L290 TraceCheckUtils]: 185: Hoare triple {131158#false} assume 4432 == #t~mem56;havoc #t~mem56; {131158#false} is VALID [2022-04-15 11:42:32,212 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-15 11:42:32,212 INFO L290 TraceCheckUtils]: 187: Hoare triple {131158#false} assume 5 == ~blastFlag~0; {131158#false} is VALID [2022-04-15 11:42:32,212 INFO L290 TraceCheckUtils]: 188: Hoare triple {131158#false} assume !false; {131158#false} is VALID [2022-04-15 11:42:32,212 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-15 11:42:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738843951] [2022-04-15 11:42:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738843951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:32,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:32,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:32,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826778605] [2022-04-15 11:42:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826778605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:32,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:32,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063350570] [2022-04-15 11:42:32,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:32,214 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-15 11:42:32,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:32,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:32,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:32,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:32,316 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-15 11:42:34,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:36,150 INFO L93 Difference]: Finished difference Result 2461 states and 3585 transitions. [2022-04-15 11:42:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:36,150 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-15 11:42:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:42:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:42:36,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-15 11:42:36,468 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-15 11:42:36,553 INFO L225 Difference]: With dead ends: 2461 [2022-04-15 11:42:36,553 INFO L226 Difference]: Without dead ends: 1410 [2022-04-15 11:42:36,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:36,555 INFO L913 BasicCegarLoop]: 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-15 11:42:36,555 INFO L914 BasicCegarLoop]: 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-15 11:42:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-04-15 11:42:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1163. [2022-04-15 11:42:36,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:36,624 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-15 11:42:36,625 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-15 11:42:36,626 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-15 11:42:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:36,682 INFO L93 Difference]: Finished difference Result 1410 states and 2044 transitions. [2022-04-15 11:42:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2044 transitions. [2022-04-15 11:42:36,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:36,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:36,685 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-15 11:42:36,685 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-15 11:42:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:36,741 INFO L93 Difference]: Finished difference Result 1410 states and 2044 transitions. [2022-04-15 11:42:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2044 transitions. [2022-04-15 11:42:36,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:36,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:36,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:36,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:36,744 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-15 11:42:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1697 transitions. [2022-04-15 11:42:36,804 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1697 transitions. Word has length 189 [2022-04-15 11:42:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:36,805 INFO L478 AbstractCegarLoop]: Abstraction has 1163 states and 1697 transitions. [2022-04-15 11:42:36,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:36,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1163 states and 1697 transitions. [2022-04-15 11:42:38,559 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-15 11:42:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1697 transitions. [2022-04-15 11:42:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-15 11:42:38,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:38,561 INFO L499 BasicCegarLoop]: 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-15 11:42:38,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:42:38,561 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash -412432023, now seen corresponding path program 1 times [2022-04-15 11:42:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:38,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654355480] [2022-04-15 11:42:53,354 WARN L232 SmtUtils]: Spent 14.37s 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-15 11:43:01,988 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-15 11:43:09,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -412432023, now seen corresponding path program 2 times [2022-04-15 11:43:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:09,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280529596] [2022-04-15 11:43:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:09,345 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-15 11:43:09,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {141237#true} assume true; {141237#true} is VALID [2022-04-15 11:43:09,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141237#true} {141237#true} #592#return; {141237#true} is VALID [2022-04-15 11:43:09,346 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-15 11:43:09,346 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-15 11:43:09,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {141237#true} assume true; {141237#true} is VALID [2022-04-15 11:43:09,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141237#true} {141237#true} #592#return; {141237#true} is VALID [2022-04-15 11:43:09,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {141237#true} call #t~ret159 := main(); {141237#true} is VALID [2022-04-15 11:43:09,347 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-15 11:43:09,347 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-15 11:43:09,347 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-15 11:43:09,347 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-15 11:43:09,347 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-15 11:43:09,347 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-15 11:43:09,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,347 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-15 11:43:09,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {141237#true} assume 12292 == #t~mem43;havoc #t~mem43; {141237#true} is VALID [2022-04-15 11:43:09,348 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-15 11:43:09,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {141237#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {141237#true} is VALID [2022-04-15 11:43:09,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {141237#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {141237#true} is VALID [2022-04-15 11:43:09,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {141237#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {141237#true} is VALID [2022-04-15 11:43:09,348 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-15 11:43:09,348 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-15 11:43:09,348 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-15 11:43:09,348 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-15 11:43:09,348 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-15 11:43:09,348 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-15 11:43:09,348 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-15 11:43:09,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-15 11:43:09,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {141237#true} assume 4368 == #t~mem48;havoc #t~mem48; {141237#true} is VALID [2022-04-15 11:43:09,349 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-15 11:43:09,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {141237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {141237#true} is VALID [2022-04-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,349 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-15 11:43:09,350 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-15 11:43:09,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-15 11:43:09,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 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-15 11:43:09,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {141237#true} assume 4384 == #t~mem50;havoc #t~mem50; {141237#true} is VALID [2022-04-15 11:43:09,350 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-15 11:43:09,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {141237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {141237#true} is VALID [2022-04-15 11:43:09,351 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-15 11:43:09,351 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-15 11:43:09,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {141237#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-15 11:43:09,351 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-15 11:43:09,351 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-15 11:43:09,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-15 11:43:09,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,351 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-15 11:43:09,351 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-15 11:43:09,351 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-15 11:43:09,351 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-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {141237#true} assume 4400 == #t~mem52;havoc #t~mem52; {141237#true} is VALID [2022-04-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 INFO L290 TraceCheckUtils]: 73: Hoare triple {141237#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {141237#true} is VALID [2022-04-15 11:43:09,352 INFO L290 TraceCheckUtils]: 74: Hoare triple {141237#true} assume !(~ret~0 <= 0); {141237#true} is VALID [2022-04-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,352 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-15 11:43:09,353 INFO L290 TraceCheckUtils]: 78: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-15 11:43:09,353 INFO L290 TraceCheckUtils]: 79: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,353 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-15 11:43:09,354 INFO L290 TraceCheckUtils]: 92: Hoare triple {141237#true} assume 4416 == #t~mem54;havoc #t~mem54; {141237#true} is VALID [2022-04-15 11:43:09,354 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-15 11:43:09,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {141237#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {141237#true} is VALID [2022-04-15 11:43:09,354 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-15 11:43:09,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {141237#true} assume !(0 == ~tmp___6~0); {141237#true} is VALID [2022-04-15 11:43:09,354 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-15 11:43:09,354 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-15 11:43:09,354 INFO L290 TraceCheckUtils]: 99: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-15 11:43:09,354 INFO L290 TraceCheckUtils]: 100: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,354 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-15 11:43:09,354 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-15 11:43:09,354 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-15 11:43:09,354 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 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-15 11:43:09,355 INFO L290 TraceCheckUtils]: 115: Hoare triple {141237#true} assume 4432 == #t~mem56;havoc #t~mem56; {141237#true} is VALID [2022-04-15 11:43:09,355 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-15 11:43:09,355 INFO L290 TraceCheckUtils]: 117: Hoare triple {141237#true} assume !(5 == ~blastFlag~0); {141237#true} is VALID [2022-04-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 INFO L290 TraceCheckUtils]: 121: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-15 11:43:09,356 INFO L290 TraceCheckUtils]: 122: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,356 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 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-15 11:43:09,357 INFO L290 TraceCheckUtils]: 139: Hoare triple {141237#true} assume 4448 == #t~mem58;havoc #t~mem58; {141237#true} is VALID [2022-04-15 11:43:09,357 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-15 11:43:09,357 INFO L290 TraceCheckUtils]: 141: Hoare triple {141237#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {141237#true} is VALID [2022-04-15 11:43:09,357 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-15 11:43:09,358 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-15 11:43:09,359 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-15 11:43:09,360 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-15 11:43:09,360 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-15 11:43:09,360 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-15 11:43:09,361 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-15 11:43:09,361 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-15 11:43:09,361 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-15 11:43:09,362 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-15 11:43:09,362 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-15 11:43:09,362 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-15 11:43:09,363 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-15 11:43:09,363 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-15 11:43:09,364 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-15 11:43:09,364 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-15 11:43:09,364 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-15 11:43:09,365 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-15 11:43:09,365 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-15 11:43:09,366 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-15 11:43:09,366 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-15 11:43:09,366 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-15 11:43:09,366 INFO L290 TraceCheckUtils]: 164: Hoare triple {141238#false} assume !(3 == ~blastFlag~0); {141238#false} is VALID [2022-04-15 11:43:09,366 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-15 11:43:09,366 INFO L290 TraceCheckUtils]: 166: Hoare triple {141238#false} assume !(0 == ~tmp___6~0); {141238#false} is VALID [2022-04-15 11:43:09,366 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-15 11:43:09,366 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-15 11:43:09,366 INFO L290 TraceCheckUtils]: 169: Hoare triple {141238#false} ~skip~0 := 0; {141238#false} is VALID [2022-04-15 11:43:09,367 INFO L290 TraceCheckUtils]: 170: Hoare triple {141238#false} assume !false; {141238#false} is VALID [2022-04-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,367 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-15 11:43:09,368 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-15 11:43:09,368 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-15 11:43:09,368 INFO L290 TraceCheckUtils]: 185: Hoare triple {141238#false} assume 4432 == #t~mem56;havoc #t~mem56; {141238#false} is VALID [2022-04-15 11:43:09,368 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-15 11:43:09,368 INFO L290 TraceCheckUtils]: 187: Hoare triple {141238#false} assume 5 == ~blastFlag~0; {141238#false} is VALID [2022-04-15 11:43:09,368 INFO L290 TraceCheckUtils]: 188: Hoare triple {141238#false} assume !false; {141238#false} is VALID [2022-04-15 11:43:09,368 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-15 11:43:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:09,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280529596] [2022-04-15 11:43:09,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280529596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:09,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:09,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:09,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:09,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654355480] [2022-04-15 11:43:09,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654355480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:09,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:09,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:09,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589854258] [2022-04-15 11:43:09,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:09,370 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-15 11:43:09,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:09,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:09,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:09,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:09,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:09,476 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-15 11:43:11,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:12,957 INFO L93 Difference]: Finished difference Result 2636 states and 3824 transitions. [2022-04-15 11:43:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:12,957 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-15 11:43:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:43:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:43:12,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-15 11:43:13,300 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-15 11:43:13,383 INFO L225 Difference]: With dead ends: 2636 [2022-04-15 11:43:13,383 INFO L226 Difference]: Without dead ends: 1489 [2022-04-15 11:43:13,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:13,385 INFO L913 BasicCegarLoop]: 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-15 11:43:13,386 INFO L914 BasicCegarLoop]: 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-15 11:43:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-04-15 11:43:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1067. [2022-04-15 11:43:13,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:13,462 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-15 11:43:13,462 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-15 11:43:13,463 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-15 11:43:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:13,525 INFO L93 Difference]: Finished difference Result 1489 states and 2138 transitions. [2022-04-15 11:43:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2138 transitions. [2022-04-15 11:43:13,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:13,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:13,528 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-15 11:43:13,528 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-15 11:43:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:13,590 INFO L93 Difference]: Finished difference Result 1489 states and 2138 transitions. [2022-04-15 11:43:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2138 transitions. [2022-04-15 11:43:13,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:13,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:13,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:13,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:13,593 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-15 11:43:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1548 transitions. [2022-04-15 11:43:13,644 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1548 transitions. Word has length 189 [2022-04-15 11:43:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:13,644 INFO L478 AbstractCegarLoop]: Abstraction has 1067 states and 1548 transitions. [2022-04-15 11:43:13,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:13,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1548 transitions. [2022-04-15 11:43:15,293 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-15 11:43:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1548 transitions. [2022-04-15 11:43:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-15 11:43:15,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:15,295 INFO L499 BasicCegarLoop]: 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-15 11:43:15,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:43:15,295 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 1 times [2022-04-15 11:43:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:15,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66257046] [2022-04-15 11:43:15,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 2 times [2022-04-15 11:43:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:15,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926516860] [2022-04-15 11:43:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:15,516 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-15 11:43:15,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {151633#true} assume true; {151633#true} is VALID [2022-04-15 11:43:15,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151633#true} {151633#true} #592#return; {151633#true} is VALID [2022-04-15 11:43:15,517 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-15 11:43:15,518 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-15 11:43:15,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {151633#true} assume true; {151633#true} is VALID [2022-04-15 11:43:15,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151633#true} {151633#true} #592#return; {151633#true} is VALID [2022-04-15 11:43:15,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {151633#true} call #t~ret159 := main(); {151633#true} is VALID [2022-04-15 11:43:15,518 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-15 11:43:15,518 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-15 11:43:15,518 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-15 11:43:15,518 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-15 11:43:15,518 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-15 11:43:15,518 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-15 11:43:15,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,518 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-15 11:43:15,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {151633#true} assume 12292 == #t~mem43;havoc #t~mem43; {151633#true} is VALID [2022-04-15 11:43:15,519 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-15 11:43:15,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {151633#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {151633#true} is VALID [2022-04-15 11:43:15,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {151633#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {151633#true} is VALID [2022-04-15 11:43:15,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {151633#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {151633#true} is VALID [2022-04-15 11:43:15,519 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-15 11:43:15,519 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-15 11:43:15,519 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-15 11:43:15,519 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-15 11:43:15,519 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-15 11:43:15,519 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-15 11:43:15,519 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-15 11:43:15,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-15 11:43:15,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,520 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-15 11:43:15,520 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-15 11:43:15,520 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-15 11:43:15,520 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-15 11:43:15,520 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-15 11:43:15,520 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-15 11:43:15,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {151633#true} assume 4368 == #t~mem48;havoc #t~mem48; {151633#true} is VALID [2022-04-15 11:43:15,520 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-15 11:43:15,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {151633#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {151633#true} is VALID [2022-04-15 11:43:15,520 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-15 11:43:15,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,521 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-15 11:43:15,522 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-15 11:43:15,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {151633#true} assume 4384 == #t~mem50;havoc #t~mem50; {151633#true} is VALID [2022-04-15 11:43:15,522 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-15 11:43:15,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {151633#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {151633#true} is VALID [2022-04-15 11:43:15,522 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-15 11:43:15,522 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-15 11:43:15,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {151633#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-15 11:43:15,522 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-15 11:43:15,522 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-15 11:43:15,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-15 11:43:15,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,522 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-15 11:43:15,522 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {151633#true} assume 4400 == #t~mem52;havoc #t~mem52; {151633#true} is VALID [2022-04-15 11:43:15,523 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-15 11:43:15,523 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-15 11:43:15,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {151633#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {151633#true} is VALID [2022-04-15 11:43:15,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {151633#true} assume !(~ret~0 <= 0); {151633#true} is VALID [2022-04-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-15 11:43:15,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,524 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-15 11:43:15,525 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-15 11:43:15,525 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-15 11:43:15,525 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-15 11:43:15,525 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-15 11:43:15,525 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-15 11:43:15,525 INFO L290 TraceCheckUtils]: 92: Hoare triple {151633#true} assume 4416 == #t~mem54;havoc #t~mem54; {151633#true} is VALID [2022-04-15 11:43:15,525 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-15 11:43:15,525 INFO L290 TraceCheckUtils]: 94: Hoare triple {151633#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {151633#true} is VALID [2022-04-15 11:43:15,525 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-15 11:43:15,547 INFO L290 TraceCheckUtils]: 96: Hoare triple {151633#true} assume !(0 == ~tmp___6~0); {151633#true} is VALID [2022-04-15 11:43:15,547 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-15 11:43:15,547 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-15 11:43:15,547 INFO L290 TraceCheckUtils]: 99: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-15 11:43:15,547 INFO L290 TraceCheckUtils]: 100: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,547 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-15 11:43:15,547 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-15 11:43:15,547 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-15 11:43:15,547 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-15 11:43:15,547 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 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-15 11:43:15,548 INFO L290 TraceCheckUtils]: 115: Hoare triple {151633#true} assume 4432 == #t~mem56;havoc #t~mem56; {151633#true} is VALID [2022-04-15 11:43:15,548 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-15 11:43:15,548 INFO L290 TraceCheckUtils]: 117: Hoare triple {151633#true} assume !(5 == ~blastFlag~0); {151633#true} is VALID [2022-04-15 11:43:15,548 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 INFO L290 TraceCheckUtils]: 121: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-15 11:43:15,549 INFO L290 TraceCheckUtils]: 122: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,549 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 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-15 11:43:15,550 INFO L290 TraceCheckUtils]: 139: Hoare triple {151633#true} assume 4448 == #t~mem58;havoc #t~mem58; {151633#true} is VALID [2022-04-15 11:43:15,550 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-15 11:43:15,550 INFO L290 TraceCheckUtils]: 141: Hoare triple {151633#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {151633#true} is VALID [2022-04-15 11:43:15,551 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-15 11:43:15,553 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-15 11:43:15,553 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-15 11:43:15,554 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-15 11:43:15,554 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-15 11:43:15,554 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-15 11:43:15,555 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-15 11:43:15,555 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-15 11:43:15,555 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-15 11:43:15,556 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-15 11:43:15,556 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-15 11:43:15,556 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-15 11:43:15,557 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-15 11:43:15,557 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-15 11:43:15,557 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-15 11:43:15,558 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-15 11:43:15,558 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-15 11:43:15,558 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-15 11:43:15,558 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-15 11:43:15,559 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-15 11:43:15,559 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-15 11:43:15,559 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-15 11:43:15,560 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-15 11:43:15,560 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-15 11:43:15,560 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-15 11:43:15,561 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-15 11:43:15,561 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-15 11:43:15,561 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-15 11:43:15,562 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-15 11:43:15,562 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-15 11:43:15,562 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-15 11:43:15,563 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-15 11:43:15,564 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-15 11:43:15,564 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-15 11:43:15,572 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-15 11:43:15,572 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-15 11:43:15,573 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-15 11:43:15,573 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-15 11:43:15,573 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-15 11:43:15,573 INFO L290 TraceCheckUtils]: 181: Hoare triple {151634#false} assume !(0 == ~tmp___8~0); {151634#false} is VALID [2022-04-15 11:43:15,573 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-15 11:43:15,573 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-15 11:43:15,573 INFO L290 TraceCheckUtils]: 184: Hoare triple {151634#false} ~skip~0 := 0; {151634#false} is VALID [2022-04-15 11:43:15,573 INFO L290 TraceCheckUtils]: 185: Hoare triple {151634#false} assume !false; {151634#false} is VALID [2022-04-15 11:43:15,573 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-15 11:43:15,573 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,574 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-15 11:43:15,575 INFO L290 TraceCheckUtils]: 200: Hoare triple {151634#false} assume 4432 == #t~mem56;havoc #t~mem56; {151634#false} is VALID [2022-04-15 11:43:15,575 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-15 11:43:15,575 INFO L290 TraceCheckUtils]: 202: Hoare triple {151634#false} assume 5 == ~blastFlag~0; {151634#false} is VALID [2022-04-15 11:43:15,575 INFO L290 TraceCheckUtils]: 203: Hoare triple {151634#false} assume !false; {151634#false} is VALID [2022-04-15 11:43:15,575 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-15 11:43:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:15,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926516860] [2022-04-15 11:43:15,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926516860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:15,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:15,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:15,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:15,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66257046] [2022-04-15 11:43:15,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66257046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:15,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:15,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059369953] [2022-04-15 11:43:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:15,577 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-15 11:43:15,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:15,577 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-15 11:43:15,684 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-15 11:43:15,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:15,685 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-15 11:43:17,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:19,140 INFO L93 Difference]: Finished difference Result 2579 states and 3716 transitions. [2022-04-15 11:43:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:19,140 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-15 11:43:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:19,140 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-15 11:43:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:43:19,142 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-15 11:43:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:43:19,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 11:43:19,480 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-15 11:43:19,569 INFO L225 Difference]: With dead ends: 2579 [2022-04-15 11:43:19,569 INFO L226 Difference]: Without dead ends: 1528 [2022-04-15 11:43:19,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:19,571 INFO L913 BasicCegarLoop]: 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-15 11:43:19,571 INFO L914 BasicCegarLoop]: 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-15 11:43:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2022-04-15 11:43:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1257. [2022-04-15 11:43:19,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:19,719 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-15 11:43:19,720 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-15 11:43:19,721 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-15 11:43:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:19,799 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2022-04-15 11:43:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2183 transitions. [2022-04-15 11:43:19,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:19,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:19,802 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-15 11:43:19,803 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-15 11:43:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:19,867 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2022-04-15 11:43:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2183 transitions. [2022-04-15 11:43:19,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:19,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:19,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:19,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:19,870 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-15 11:43:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1843 transitions. [2022-04-15 11:43:19,937 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1843 transitions. Word has length 204 [2022-04-15 11:43:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:19,937 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 1843 transitions. [2022-04-15 11:43:19,938 INFO L479 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-15 11:43:19,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 1843 transitions. [2022-04-15 11:43:22,044 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-15 11:43:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1843 transitions. [2022-04-15 11:43:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-15 11:43:22,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:22,047 INFO L499 BasicCegarLoop]: 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-15 11:43:22,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:43:22,047 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072511, now seen corresponding path program 1 times [2022-04-15 11:43:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:22,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [511384372] [2022-04-15 11:43:22,048 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072511, now seen corresponding path program 2 times [2022-04-15 11:43:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:22,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567695529] [2022-04-15 11:43:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:22,268 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-15 11:43:22,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {162373#true} assume true; {162373#true} is VALID [2022-04-15 11:43:22,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162373#true} {162373#true} #592#return; {162373#true} is VALID [2022-04-15 11:43:22,269 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-15 11:43:22,269 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-15 11:43:22,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {162373#true} assume true; {162373#true} is VALID [2022-04-15 11:43:22,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162373#true} {162373#true} #592#return; {162373#true} is VALID [2022-04-15 11:43:22,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {162373#true} call #t~ret159 := main(); {162373#true} is VALID [2022-04-15 11:43:22,269 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-15 11:43:22,269 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-15 11:43:22,269 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-15 11:43:22,269 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-15 11:43:22,270 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-15 11:43:22,270 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-15 11:43:22,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,270 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-15 11:43:22,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {162373#true} assume 12292 == #t~mem43;havoc #t~mem43; {162373#true} is VALID [2022-04-15 11:43:22,270 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-15 11:43:22,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {162373#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {162373#true} is VALID [2022-04-15 11:43:22,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {162373#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {162373#true} is VALID [2022-04-15 11:43:22,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {162373#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {162373#true} is VALID [2022-04-15 11:43:22,270 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-15 11:43:22,270 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-15 11:43:22,270 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-15 11:43:22,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,271 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-15 11:43:22,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {162373#true} assume 4368 == #t~mem48;havoc #t~mem48; {162373#true} is VALID [2022-04-15 11:43:22,272 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-15 11:43:22,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {162373#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {162373#true} is VALID [2022-04-15 11:43:22,272 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-15 11:43:22,272 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-15 11:43:22,272 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-15 11:43:22,272 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-15 11:43:22,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-15 11:43:22,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,272 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-15 11:43:22,272 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-15 11:43:22,272 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-15 11:43:22,273 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-15 11:43:22,273 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-15 11:43:22,273 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-15 11:43:22,273 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-15 11:43:22,273 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-15 11:43:22,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {162373#true} assume 4384 == #t~mem50;havoc #t~mem50; {162373#true} is VALID [2022-04-15 11:43:22,273 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-15 11:43:22,273 INFO L290 TraceCheckUtils]: 52: Hoare triple {162373#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {162373#true} is VALID [2022-04-15 11:43:22,273 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-15 11:43:22,273 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-15 11:43:22,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {162373#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-15 11:43:22,273 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-15 11:43:22,273 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-15 11:43:22,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-15 11:43:22,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,273 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 INFO L290 TraceCheckUtils]: 70: Hoare triple {162373#true} assume 4400 == #t~mem52;havoc #t~mem52; {162373#true} is VALID [2022-04-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {162373#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {162373#true} is VALID [2022-04-15 11:43:22,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {162373#true} assume !(~ret~0 <= 0); {162373#true} is VALID [2022-04-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 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-15 11:43:22,274 INFO L290 TraceCheckUtils]: 78: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-15 11:43:22,274 INFO L290 TraceCheckUtils]: 79: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 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-15 11:43:22,275 INFO L290 TraceCheckUtils]: 92: Hoare triple {162373#true} assume 4416 == #t~mem54;havoc #t~mem54; {162373#true} is VALID [2022-04-15 11:43:22,275 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-15 11:43:22,275 INFO L290 TraceCheckUtils]: 94: Hoare triple {162373#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {162373#true} is VALID [2022-04-15 11:43:22,275 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-15 11:43:22,275 INFO L290 TraceCheckUtils]: 96: Hoare triple {162373#true} assume !(0 == ~tmp___6~0); {162373#true} is VALID [2022-04-15 11:43:22,275 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-15 11:43:22,276 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-15 11:43:22,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-15 11:43:22,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 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-15 11:43:22,276 INFO L290 TraceCheckUtils]: 115: Hoare triple {162373#true} assume 4432 == #t~mem56;havoc #t~mem56; {162373#true} is VALID [2022-04-15 11:43:22,276 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-15 11:43:22,277 INFO L290 TraceCheckUtils]: 117: Hoare triple {162373#true} assume !(5 == ~blastFlag~0); {162373#true} is VALID [2022-04-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 INFO L290 TraceCheckUtils]: 121: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-15 11:43:22,277 INFO L290 TraceCheckUtils]: 122: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,277 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-15 11:43:22,278 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-15 11:43:22,278 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-15 11:43:22,278 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-15 11:43:22,278 INFO L290 TraceCheckUtils]: 139: Hoare triple {162373#true} assume 4448 == #t~mem58;havoc #t~mem58; {162373#true} is VALID [2022-04-15 11:43:22,278 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-15 11:43:22,278 INFO L290 TraceCheckUtils]: 141: Hoare triple {162373#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {162373#true} is VALID [2022-04-15 11:43:22,278 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-15 11:43:22,279 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-15 11:43:22,279 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-15 11:43:22,280 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-15 11:43:22,280 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-15 11:43:22,280 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-15 11:43:22,281 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-15 11:43:22,281 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-15 11:43:22,281 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-15 11:43:22,282 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-15 11:43:22,282 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-15 11:43:22,282 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-15 11:43:22,283 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-15 11:43:22,283 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-15 11:43:22,283 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-15 11:43:22,284 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-15 11:43:22,284 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-15 11:43:22,284 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-15 11:43:22,285 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-15 11:43:22,285 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-15 11:43:22,285 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-15 11:43:22,286 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-15 11:43:22,286 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-15 11:43:22,286 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-15 11:43:22,287 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-15 11:43:22,287 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-15 11:43:22,287 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-15 11:43:22,288 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-15 11:43:22,288 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-15 11:43:22,288 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-15 11:43:22,289 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-15 11:43:22,289 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-15 11:43:22,289 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-15 11:43:22,290 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-15 11:43:22,291 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-15 11:43:22,291 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-15 11:43:22,291 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-15 11:43:22,291 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-15 11:43:22,291 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-15 11:43:22,291 INFO L290 TraceCheckUtils]: 181: Hoare triple {162374#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162374#false} is VALID [2022-04-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 INFO L290 TraceCheckUtils]: 184: Hoare triple {162374#false} ~skip~0 := 0; {162374#false} is VALID [2022-04-15 11:43:22,292 INFO L290 TraceCheckUtils]: 185: Hoare triple {162374#false} assume !false; {162374#false} is VALID [2022-04-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,292 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-15 11:43:22,293 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-15 11:43:22,293 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-15 11:43:22,293 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-15 11:43:22,293 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-15 11:43:22,293 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-15 11:43:22,293 INFO L290 TraceCheckUtils]: 200: Hoare triple {162374#false} assume 4432 == #t~mem56;havoc #t~mem56; {162374#false} is VALID [2022-04-15 11:43:22,293 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-15 11:43:22,293 INFO L290 TraceCheckUtils]: 202: Hoare triple {162374#false} assume 5 == ~blastFlag~0; {162374#false} is VALID [2022-04-15 11:43:22,293 INFO L290 TraceCheckUtils]: 203: Hoare triple {162374#false} assume !false; {162374#false} is VALID [2022-04-15 11:43:22,294 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-15 11:43:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:22,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567695529] [2022-04-15 11:43:22,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567695529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:22,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:22,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:22,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [511384372] [2022-04-15 11:43:22,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [511384372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:22,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:22,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816507086] [2022-04-15 11:43:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:22,296 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-15 11:43:22,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:22,296 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-15 11:43:22,431 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-15 11:43:22,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:22,432 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-15 11:43:24,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,039 INFO L93 Difference]: Finished difference Result 2824 states and 4116 transitions. [2022-04-15 11:43:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:26,040 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-15 11:43:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:26,040 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-15 11:43:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:43:26,042 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-15 11:43:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:43:26,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:43:26,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:26,494 INFO L225 Difference]: With dead ends: 2824 [2022-04-15 11:43:26,494 INFO L226 Difference]: Without dead ends: 1583 [2022-04-15 11:43:26,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:26,496 INFO L913 BasicCegarLoop]: 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-15 11:43:26,497 INFO L914 BasicCegarLoop]: 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-15 11:43:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-15 11:43:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1322. [2022-04-15 11:43:26,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:26,595 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-15 11:43:26,596 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-15 11:43:26,597 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-15 11:43:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,678 INFO L93 Difference]: Finished difference Result 1583 states and 2288 transitions. [2022-04-15 11:43:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2288 transitions. [2022-04-15 11:43:26,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:26,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:26,681 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-15 11:43:26,682 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-15 11:43:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,762 INFO L93 Difference]: Finished difference Result 1583 states and 2288 transitions. [2022-04-15 11:43:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2288 transitions. [2022-04-15 11:43:26,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:26,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:26,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:26,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:26,765 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-15 11:43:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1968 transitions. [2022-04-15 11:43:26,867 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1968 transitions. Word has length 204 [2022-04-15 11:43:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:26,868 INFO L478 AbstractCegarLoop]: Abstraction has 1322 states and 1968 transitions. [2022-04-15 11:43:26,868 INFO L479 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-15 11:43:26,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1322 states and 1968 transitions. [2022-04-15 11:43:29,154 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-15 11:43:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1968 transitions. [2022-04-15 11:43:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-15 11:43:29,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:29,156 INFO L499 BasicCegarLoop]: 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-15 11:43:29,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:43:29,156 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:29,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1665641358, now seen corresponding path program 1 times [2022-04-15 11:43:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:29,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699879345] [2022-04-15 11:43:29,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1665641358, now seen corresponding path program 2 times [2022-04-15 11:43:29,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:29,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968022670] [2022-04-15 11:43:29,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:29,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:29,400 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-15 11:43:29,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {173843#true} assume true; {173843#true} is VALID [2022-04-15 11:43:29,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173843#true} {173843#true} #592#return; {173843#true} is VALID [2022-04-15 11:43:29,403 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-15 11:43:29,403 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-15 11:43:29,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {173843#true} assume true; {173843#true} is VALID [2022-04-15 11:43:29,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173843#true} {173843#true} #592#return; {173843#true} is VALID [2022-04-15 11:43:29,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {173843#true} call #t~ret159 := main(); {173843#true} is VALID [2022-04-15 11:43:29,404 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-15 11:43:29,404 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-15 11:43:29,404 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-15 11:43:29,404 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-15 11:43:29,404 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-15 11:43:29,404 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-15 11:43:29,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,404 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-15 11:43:29,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {173843#true} assume 12292 == #t~mem43;havoc #t~mem43; {173843#true} is VALID [2022-04-15 11:43:29,404 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-15 11:43:29,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {173843#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {173843#true} is VALID [2022-04-15 11:43:29,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {173843#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {173843#true} is VALID [2022-04-15 11:43:29,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {173843#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {173843#true} is VALID [2022-04-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-15 11:43:29,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,405 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-15 11:43:29,405 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-15 11:43:29,406 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-15 11:43:29,406 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-15 11:43:29,406 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-15 11:43:29,406 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-15 11:43:29,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {173843#true} assume 4368 == #t~mem48;havoc #t~mem48; {173843#true} is VALID [2022-04-15 11:43:29,406 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-15 11:43:29,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {173843#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {173843#true} is VALID [2022-04-15 11:43:29,406 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-15 11:43:29,406 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-15 11:43:29,406 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-15 11:43:29,406 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-15 11:43:29,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-15 11:43:29,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 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-15 11:43:29,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {173843#true} assume 4384 == #t~mem50;havoc #t~mem50; {173843#true} is VALID [2022-04-15 11:43:29,407 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-15 11:43:29,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {173843#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {173843#true} is VALID [2022-04-15 11:43:29,407 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-15 11:43:29,408 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-15 11:43:29,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {173843#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-15 11:43:29,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,408 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-15 11:43:29,409 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-15 11:43:29,409 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-15 11:43:29,409 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-15 11:43:29,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {173843#true} assume 4400 == #t~mem52;havoc #t~mem52; {173843#true} is VALID [2022-04-15 11:43:29,409 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-15 11:43:29,409 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-15 11:43:29,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {173843#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {173843#true} is VALID [2022-04-15 11:43:29,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {173843#true} assume !(~ret~0 <= 0); {173843#true} is VALID [2022-04-15 11:43:29,409 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-15 11:43:29,409 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-15 11:43:29,409 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-15 11:43:29,409 INFO L290 TraceCheckUtils]: 78: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-15 11:43:29,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 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-15 11:43:29,410 INFO L290 TraceCheckUtils]: 92: Hoare triple {173843#true} assume 4416 == #t~mem54;havoc #t~mem54; {173843#true} is VALID [2022-04-15 11:43:29,411 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-15 11:43:29,411 INFO L290 TraceCheckUtils]: 94: Hoare triple {173843#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {173843#true} is VALID [2022-04-15 11:43:29,411 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-15 11:43:29,411 INFO L290 TraceCheckUtils]: 96: Hoare triple {173843#true} assume !(0 == ~tmp___6~0); {173843#true} is VALID [2022-04-15 11:43:29,411 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-15 11:43:29,411 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-15 11:43:29,411 INFO L290 TraceCheckUtils]: 99: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-15 11:43:29,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,411 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-15 11:43:29,411 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-15 11:43:29,411 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-15 11:43:29,411 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 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-15 11:43:29,412 INFO L290 TraceCheckUtils]: 115: Hoare triple {173843#true} assume 4432 == #t~mem56;havoc #t~mem56; {173843#true} is VALID [2022-04-15 11:43:29,412 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-15 11:43:29,412 INFO L290 TraceCheckUtils]: 117: Hoare triple {173843#true} assume !(5 == ~blastFlag~0); {173843#true} is VALID [2022-04-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 INFO L290 TraceCheckUtils]: 121: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-15 11:43:29,413 INFO L290 TraceCheckUtils]: 122: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,413 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 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-15 11:43:29,414 INFO L290 TraceCheckUtils]: 139: Hoare triple {173843#true} assume 4448 == #t~mem58;havoc #t~mem58; {173843#true} is VALID [2022-04-15 11:43:29,414 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-15 11:43:29,414 INFO L290 TraceCheckUtils]: 141: Hoare triple {173843#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {173843#true} is VALID [2022-04-15 11:43:29,414 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-15 11:43:29,415 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-15 11:43:29,416 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-15 11:43:29,417 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-15 11:43:29,417 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-15 11:43:29,417 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-15 11:43:29,417 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-15 11:43:29,418 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-15 11:43:29,418 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-15 11:43:29,418 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-15 11:43:29,419 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-15 11:43:29,419 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-15 11:43:29,419 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-15 11:43:29,420 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-15 11:43:29,420 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-15 11:43:29,420 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-15 11:43:29,420 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-15 11:43:29,421 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-15 11:43:29,421 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-15 11:43:29,421 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-15 11:43:29,422 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-15 11:43:29,422 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-15 11:43:29,422 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-15 11:43:29,422 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-15 11:43:29,423 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-15 11:43:29,423 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-15 11:43:29,423 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-15 11:43:29,424 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-15 11:43:29,424 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-15 11:43:29,424 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-15 11:43:29,424 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-15 11:43:29,425 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-15 11:43:29,425 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-15 11:43:29,425 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-15 11:43:29,426 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-15 11:43:29,426 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-15 11:43:29,426 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-15 11:43:29,426 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-15 11:43:29,426 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-15 11:43:29,426 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-15 11:43:29,426 INFO L290 TraceCheckUtils]: 182: Hoare triple {173844#false} assume !(0 == ~tmp___8~0); {173844#false} is VALID [2022-04-15 11:43:29,426 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-15 11:43:29,426 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-15 11:43:29,427 INFO L290 TraceCheckUtils]: 185: Hoare triple {173844#false} ~skip~0 := 0; {173844#false} is VALID [2022-04-15 11:43:29,427 INFO L290 TraceCheckUtils]: 186: Hoare triple {173844#false} assume !false; {173844#false} is VALID [2022-04-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,427 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-15 11:43:29,428 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-15 11:43:29,428 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-15 11:43:29,428 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-15 11:43:29,428 INFO L290 TraceCheckUtils]: 201: Hoare triple {173844#false} assume 4432 == #t~mem56;havoc #t~mem56; {173844#false} is VALID [2022-04-15 11:43:29,428 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-15 11:43:29,428 INFO L290 TraceCheckUtils]: 203: Hoare triple {173844#false} assume 5 == ~blastFlag~0; {173844#false} is VALID [2022-04-15 11:43:29,428 INFO L290 TraceCheckUtils]: 204: Hoare triple {173844#false} assume !false; {173844#false} is VALID [2022-04-15 11:43:29,429 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-15 11:43:29,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:29,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968022670] [2022-04-15 11:43:29,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968022670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:29,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:29,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699879345] [2022-04-15 11:43:29,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699879345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:29,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400658708] [2022-04-15 11:43:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:29,432 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-15 11:43:29,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:29,432 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-15 11:43:29,543 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-15 11:43:29,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:29,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:29,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:29,544 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-15 11:43:31,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:33,099 INFO L93 Difference]: Finished difference Result 2889 states and 4236 transitions. [2022-04-15 11:43:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:33,100 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-15 11:43:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:33,100 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-15 11:43:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:43:33,102 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-15 11:43:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:43:33,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:43:33,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:33,556 INFO L225 Difference]: With dead ends: 2889 [2022-04-15 11:43:33,556 INFO L226 Difference]: Without dead ends: 1583 [2022-04-15 11:43:33,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:33,558 INFO L913 BasicCegarLoop]: 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-15 11:43:33,558 INFO L914 BasicCegarLoop]: 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-15 11:43:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-15 11:43:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1322. [2022-04-15 11:43:33,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:33,665 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-15 11:43:33,666 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-15 11:43:33,666 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-15 11:43:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:33,742 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2022-04-15 11:43:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2283 transitions. [2022-04-15 11:43:33,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:33,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:33,745 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-15 11:43:33,746 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-15 11:43:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:33,832 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2022-04-15 11:43:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2283 transitions. [2022-04-15 11:43:33,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:33,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:33,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:33,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:33,836 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-15 11:43:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1963 transitions. [2022-04-15 11:43:33,917 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1963 transitions. Word has length 205 [2022-04-15 11:43:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:33,917 INFO L478 AbstractCegarLoop]: Abstraction has 1322 states and 1963 transitions. [2022-04-15 11:43:33,917 INFO L479 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-15 11:43:33,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1322 states and 1963 transitions. [2022-04-15 11:43:36,249 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-15 11:43:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1963 transitions. [2022-04-15 11:43:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-15 11:43:36,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:36,251 INFO L499 BasicCegarLoop]: 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-15 11:43:36,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:43:36,251 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1752889520, now seen corresponding path program 1 times [2022-04-15 11:43:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:36,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792955035] [2022-04-15 11:43:36,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1752889520, now seen corresponding path program 2 times [2022-04-15 11:43:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:36,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076513408] [2022-04-15 11:43:36,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:36,462 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-15 11:43:36,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {185443#true} assume true; {185443#true} is VALID [2022-04-15 11:43:36,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185443#true} {185443#true} #592#return; {185443#true} is VALID [2022-04-15 11:43:36,463 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-15 11:43:36,463 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-15 11:43:36,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {185443#true} assume true; {185443#true} is VALID [2022-04-15 11:43:36,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185443#true} {185443#true} #592#return; {185443#true} is VALID [2022-04-15 11:43:36,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {185443#true} call #t~ret159 := main(); {185443#true} is VALID [2022-04-15 11:43:36,464 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-15 11:43:36,464 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-15 11:43:36,464 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-15 11:43:36,464 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-15 11:43:36,464 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-15 11:43:36,464 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-15 11:43:36,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,464 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-15 11:43:36,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {185443#true} assume 12292 == #t~mem43;havoc #t~mem43; {185443#true} is VALID [2022-04-15 11:43:36,465 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-15 11:43:36,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {185443#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {185443#true} is VALID [2022-04-15 11:43:36,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {185443#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {185443#true} is VALID [2022-04-15 11:43:36,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {185443#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {185443#true} is VALID [2022-04-15 11:43:36,465 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-15 11:43:36,465 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-15 11:43:36,465 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-15 11:43:36,465 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-15 11:43:36,465 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-15 11:43:36,465 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-15 11:43:36,465 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-15 11:43:36,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-15 11:43:36,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {185443#true} assume 4368 == #t~mem48;havoc #t~mem48; {185443#true} is VALID [2022-04-15 11:43:36,466 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-15 11:43:36,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {185443#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {185443#true} is VALID [2022-04-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,466 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-15 11:43:36,467 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-15 11:43:36,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-15 11:43:36,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 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-15 11:43:36,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {185443#true} assume 4384 == #t~mem50;havoc #t~mem50; {185443#true} is VALID [2022-04-15 11:43:36,468 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-15 11:43:36,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {185443#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {185443#true} is VALID [2022-04-15 11:43:36,468 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-15 11:43:36,468 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-15 11:43:36,468 INFO L290 TraceCheckUtils]: 55: Hoare triple {185443#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-15 11:43:36,468 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-15 11:43:36,468 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-15 11:43:36,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-15 11:43:36,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,468 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-15 11:43:36,468 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-15 11:43:36,468 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-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {185443#true} assume 4400 == #t~mem52;havoc #t~mem52; {185443#true} is VALID [2022-04-15 11:43:36,469 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-15 11:43:36,469 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-15 11:43:36,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {185443#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {185443#true} is VALID [2022-04-15 11:43:36,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {185443#true} assume !(~ret~0 <= 0); {185443#true} is VALID [2022-04-15 11:43:36,469 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-15 11:43:36,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,470 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-15 11:43:36,471 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-15 11:43:36,471 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-15 11:43:36,471 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-15 11:43:36,471 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-15 11:43:36,471 INFO L290 TraceCheckUtils]: 92: Hoare triple {185443#true} assume 4416 == #t~mem54;havoc #t~mem54; {185443#true} is VALID [2022-04-15 11:43:36,471 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-15 11:43:36,471 INFO L290 TraceCheckUtils]: 94: Hoare triple {185443#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {185443#true} is VALID [2022-04-15 11:43:36,471 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-15 11:43:36,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {185443#true} assume !(0 == ~tmp___6~0); {185443#true} is VALID [2022-04-15 11:43:36,471 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-15 11:43:36,471 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-15 11:43:36,471 INFO L290 TraceCheckUtils]: 99: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-15 11:43:36,471 INFO L290 TraceCheckUtils]: 100: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,472 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-15 11:43:36,473 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-15 11:43:36,473 INFO L290 TraceCheckUtils]: 115: Hoare triple {185443#true} assume 4432 == #t~mem56;havoc #t~mem56; {185443#true} is VALID [2022-04-15 11:43:36,473 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-15 11:43:36,473 INFO L290 TraceCheckUtils]: 117: Hoare triple {185443#true} assume !(5 == ~blastFlag~0); {185443#true} is VALID [2022-04-15 11:43:36,473 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-15 11:43:36,473 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-15 11:43:36,473 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-15 11:43:36,473 INFO L290 TraceCheckUtils]: 121: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-15 11:43:36,473 INFO L290 TraceCheckUtils]: 122: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-15 11:43:36,473 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-15 11:43:36,473 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,474 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-15 11:43:36,475 INFO L290 TraceCheckUtils]: 139: Hoare triple {185443#true} assume 4448 == #t~mem58;havoc #t~mem58; {185443#true} is VALID [2022-04-15 11:43:36,475 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-15 11:43:36,475 INFO L290 TraceCheckUtils]: 141: Hoare triple {185443#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {185443#true} is VALID [2022-04-15 11:43:36,475 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-15 11:43:36,476 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-15 11:43:36,477 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-15 11:43:36,477 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-15 11:43:36,477 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-15 11:43:36,478 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-15 11:43:36,478 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-15 11:43:36,478 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-15 11:43:36,478 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-15 11:43:36,479 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-15 11:43:36,479 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-15 11:43:36,479 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-15 11:43:36,480 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-15 11:43:36,480 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-15 11:43:36,480 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-15 11:43:36,480 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-15 11:43:36,481 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-15 11:43:36,481 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-15 11:43:36,481 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-15 11:43:36,482 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-15 11:43:36,482 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-15 11:43:36,482 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-15 11:43:36,483 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-15 11:43:36,483 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-15 11:43:36,483 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-15 11:43:36,484 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-15 11:43:36,484 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-15 11:43:36,484 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-15 11:43:36,484 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-15 11:43:36,485 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-15 11:43:36,485 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-15 11:43:36,485 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-15 11:43:36,486 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-15 11:43:36,486 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-15 11:43:36,486 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-15 11:43:36,487 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-15 11:43:36,487 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-15 11:43:36,487 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-15 11:43:36,487 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-15 11:43:36,487 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-15 11:43:36,487 INFO L290 TraceCheckUtils]: 182: Hoare triple {185444#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185444#false} is VALID [2022-04-15 11:43:36,488 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-15 11:43:36,488 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-15 11:43:36,488 INFO L290 TraceCheckUtils]: 185: Hoare triple {185444#false} ~skip~0 := 0; {185444#false} is VALID [2022-04-15 11:43:36,488 INFO L290 TraceCheckUtils]: 186: Hoare triple {185444#false} assume !false; {185444#false} is VALID [2022-04-15 11:43:36,488 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-15 11:43:36,488 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-15 11:43:36,488 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-15 11:43:36,488 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-15 11:43:36,488 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-15 11:43:36,488 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 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-15 11:43:36,489 INFO L290 TraceCheckUtils]: 201: Hoare triple {185444#false} assume 4432 == #t~mem56;havoc #t~mem56; {185444#false} is VALID [2022-04-15 11:43:36,489 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-15 11:43:36,489 INFO L290 TraceCheckUtils]: 203: Hoare triple {185444#false} assume 5 == ~blastFlag~0; {185444#false} is VALID [2022-04-15 11:43:36,490 INFO L290 TraceCheckUtils]: 204: Hoare triple {185444#false} assume !false; {185444#false} is VALID [2022-04-15 11:43:36,490 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-15 11:43:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:36,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076513408] [2022-04-15 11:43:36,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076513408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:36,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:36,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:36,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792955035] [2022-04-15 11:43:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792955035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:36,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:36,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181825242] [2022-04-15 11:43:36,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:36,492 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-15 11:43:36,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:36,492 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-15 11:43:36,609 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-15 11:43:36,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:36,610 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-15 11:43:38,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:40,212 INFO L93 Difference]: Finished difference Result 2879 states and 4216 transitions. [2022-04-15 11:43:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:40,213 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-15 11:43:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:40,213 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-15 11:43:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-15 11:43:40,215 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-15 11:43:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-15 11:43:40,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-15 11:43:40,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:40,674 INFO L225 Difference]: With dead ends: 2879 [2022-04-15 11:43:40,674 INFO L226 Difference]: Without dead ends: 1573 [2022-04-15 11:43:40,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:40,676 INFO L913 BasicCegarLoop]: 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-15 11:43:40,676 INFO L914 BasicCegarLoop]: 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-15 11:43:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-04-15 11:43:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1327. [2022-04-15 11:43:40,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:40,794 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-15 11:43:40,795 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-15 11:43:40,795 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-15 11:43:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:40,872 INFO L93 Difference]: Finished difference Result 1573 states and 2268 transitions. [2022-04-15 11:43:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2268 transitions. [2022-04-15 11:43:40,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:40,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:40,875 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-15 11:43:40,876 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-15 11:43:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:40,956 INFO L93 Difference]: Finished difference Result 1573 states and 2268 transitions. [2022-04-15 11:43:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2268 transitions. [2022-04-15 11:43:40,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:40,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:40,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:40,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:40,959 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-15 11:43:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1968 transitions. [2022-04-15 11:43:41,037 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1968 transitions. Word has length 205 [2022-04-15 11:43:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:41,037 INFO L478 AbstractCegarLoop]: Abstraction has 1327 states and 1968 transitions. [2022-04-15 11:43:41,037 INFO L479 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-15 11:43:41,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1327 states and 1968 transitions. [2022-04-15 11:43:43,495 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-15 11:43:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1968 transitions. [2022-04-15 11:43:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-15 11:43:43,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:43,497 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:43,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:43:43,497 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 1 times [2022-04-15 11:43:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:43,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65718861] [2022-04-15 11:43:55,805 WARN L232 SmtUtils]: Spent 11.90s 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-15 11:44:07,255 WARN L232 SmtUtils]: Spent 6.62s 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-15 11:44:15,309 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 2 times [2022-04-15 11:44:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:15,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530843229] [2022-04-15 11:44:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:15,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:15,535 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-15 11:44:15,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {197013#true} assume true; {197013#true} is VALID [2022-04-15 11:44:15,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197013#true} {197013#true} #592#return; {197013#true} is VALID [2022-04-15 11:44:15,536 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-15 11:44:15,536 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-15 11:44:15,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {197013#true} assume true; {197013#true} is VALID [2022-04-15 11:44:15,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197013#true} {197013#true} #592#return; {197013#true} is VALID [2022-04-15 11:44:15,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {197013#true} call #t~ret159 := main(); {197013#true} is VALID [2022-04-15 11:44:15,537 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-15 11:44:15,537 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-15 11:44:15,537 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-15 11:44:15,537 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-15 11:44:15,537 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-15 11:44:15,537 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-15 11:44:15,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,537 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-15 11:44:15,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {197013#true} assume 12292 == #t~mem43;havoc #t~mem43; {197013#true} is VALID [2022-04-15 11:44:15,537 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-15 11:44:15,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {197013#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {197013#true} is VALID [2022-04-15 11:44:15,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {197013#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {197013#true} is VALID [2022-04-15 11:44:15,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {197013#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {197013#true} is VALID [2022-04-15 11:44:15,537 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-15 11:44:15,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,538 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-15 11:44:15,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {197013#true} assume 4368 == #t~mem48;havoc #t~mem48; {197013#true} is VALID [2022-04-15 11:44:15,539 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-15 11:44:15,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {197013#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {197013#true} is VALID [2022-04-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-15 11:44:15,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,539 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-15 11:44:15,540 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-15 11:44:15,540 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-15 11:44:15,540 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-15 11:44:15,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {197013#true} assume 4384 == #t~mem50;havoc #t~mem50; {197013#true} is VALID [2022-04-15 11:44:15,540 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-15 11:44:15,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {197013#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {197013#true} is VALID [2022-04-15 11:44:15,540 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-15 11:44:15,540 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-15 11:44:15,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {197013#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-15 11:44:15,540 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-15 11:44:15,540 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-15 11:44:15,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-15 11:44:15,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,540 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 INFO L290 TraceCheckUtils]: 70: Hoare triple {197013#true} assume 4400 == #t~mem52;havoc #t~mem52; {197013#true} is VALID [2022-04-15 11:44:15,541 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-15 11:44:15,541 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-15 11:44:15,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {197013#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {197013#true} is VALID [2022-04-15 11:44:15,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {197013#true} assume !(~ret~0 <= 0); {197013#true} is VALID [2022-04-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 INFO L290 TraceCheckUtils]: 78: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-15 11:44:15,542 INFO L290 TraceCheckUtils]: 79: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,542 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-15 11:44:15,543 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-15 11:44:15,543 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-15 11:44:15,543 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-15 11:44:15,543 INFO L290 TraceCheckUtils]: 92: Hoare triple {197013#true} assume 4416 == #t~mem54;havoc #t~mem54; {197013#true} is VALID [2022-04-15 11:44:15,543 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-15 11:44:15,543 INFO L290 TraceCheckUtils]: 94: Hoare triple {197013#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {197013#true} is VALID [2022-04-15 11:44:15,543 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-15 11:44:15,543 INFO L290 TraceCheckUtils]: 96: Hoare triple {197013#true} assume !(0 == ~tmp___6~0); {197013#true} is VALID [2022-04-15 11:44:15,543 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-15 11:44:15,543 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-15 11:44:15,543 INFO L290 TraceCheckUtils]: 99: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-15 11:44:15,543 INFO L290 TraceCheckUtils]: 100: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,543 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-15 11:44:15,543 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 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-15 11:44:15,544 INFO L290 TraceCheckUtils]: 115: Hoare triple {197013#true} assume 4432 == #t~mem56;havoc #t~mem56; {197013#true} is VALID [2022-04-15 11:44:15,544 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-15 11:44:15,545 INFO L290 TraceCheckUtils]: 117: Hoare triple {197013#true} assume !(5 == ~blastFlag~0); {197013#true} is VALID [2022-04-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 INFO L290 TraceCheckUtils]: 121: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-15 11:44:15,545 INFO L290 TraceCheckUtils]: 122: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,545 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 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-15 11:44:15,546 INFO L290 TraceCheckUtils]: 139: Hoare triple {197013#true} assume 4448 == #t~mem58;havoc #t~mem58; {197013#true} is VALID [2022-04-15 11:44:15,546 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-15 11:44:15,546 INFO L290 TraceCheckUtils]: 141: Hoare triple {197013#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {197013#true} is VALID [2022-04-15 11:44:15,546 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-15 11:44:15,547 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-15 11:44:15,548 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-15 11:44:15,549 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-15 11:44:15,549 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-15 11:44:15,549 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-15 11:44:15,550 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-15 11:44:15,550 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-15 11:44:15,551 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-15 11:44:15,551 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-15 11:44:15,551 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-15 11:44:15,552 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-15 11:44:15,552 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-15 11:44:15,552 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-15 11:44:15,553 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-15 11:44:15,553 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-15 11:44:15,554 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-15 11:44:15,554 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-15 11:44:15,554 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-15 11:44:15,554 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-15 11:44:15,554 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-15 11:44:15,554 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 INFO L290 TraceCheckUtils]: 166: Hoare triple {197014#false} ~skip~0 := 0; {197014#false} is VALID [2022-04-15 11:44:15,555 INFO L290 TraceCheckUtils]: 167: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,555 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-15 11:44:15,556 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-15 11:44:15,556 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-15 11:44:15,556 INFO L290 TraceCheckUtils]: 180: Hoare triple {197014#false} assume 4416 == #t~mem54;havoc #t~mem54; {197014#false} is VALID [2022-04-15 11:44:15,556 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-15 11:44:15,556 INFO L290 TraceCheckUtils]: 182: Hoare triple {197014#false} assume !(3 == ~blastFlag~0); {197014#false} is VALID [2022-04-15 11:44:15,556 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-15 11:44:15,556 INFO L290 TraceCheckUtils]: 184: Hoare triple {197014#false} assume !(0 == ~tmp___6~0); {197014#false} is VALID [2022-04-15 11:44:15,556 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-15 11:44:15,556 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-15 11:44:15,556 INFO L290 TraceCheckUtils]: 187: Hoare triple {197014#false} ~skip~0 := 0; {197014#false} is VALID [2022-04-15 11:44:15,556 INFO L290 TraceCheckUtils]: 188: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-15 11:44:15,556 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-15 11:44:15,556 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-15 11:44:15,556 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 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-15 11:44:15,557 INFO L290 TraceCheckUtils]: 203: Hoare triple {197014#false} assume 4432 == #t~mem56;havoc #t~mem56; {197014#false} is VALID [2022-04-15 11:44:15,557 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-15 11:44:15,557 INFO L290 TraceCheckUtils]: 205: Hoare triple {197014#false} assume 5 == ~blastFlag~0; {197014#false} is VALID [2022-04-15 11:44:15,558 INFO L290 TraceCheckUtils]: 206: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-15 11:44:15,558 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-15 11:44:15,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:15,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530843229] [2022-04-15 11:44:15,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530843229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:15,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:15,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:15,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:15,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65718861] [2022-04-15 11:44:15,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65718861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:15,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:15,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:15,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072003289] [2022-04-15 11:44:15,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:15,560 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-15 11:44:15,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:15,560 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-15 11:44:15,657 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-15 11:44:15,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:15,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:15,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:15,658 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-15 11:44:17,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:19,328 INFO L93 Difference]: Finished difference Result 2884 states and 4216 transitions. [2022-04-15 11:44:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:19,328 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-15 11:44:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:19,329 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-15 11:44:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-15 11:44:19,331 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-15 11:44:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-15 11:44:19,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-15 11:44:19,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:19,771 INFO L225 Difference]: With dead ends: 2884 [2022-04-15 11:44:19,771 INFO L226 Difference]: Without dead ends: 1573 [2022-04-15 11:44:19,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:19,773 INFO L913 BasicCegarLoop]: 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-15 11:44:19,773 INFO L914 BasicCegarLoop]: 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-15 11:44:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-04-15 11:44:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1327. [2022-04-15 11:44:19,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:19,971 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-15 11:44:19,972 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-15 11:44:19,973 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-15 11:44:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,054 INFO L93 Difference]: Finished difference Result 1573 states and 2253 transitions. [2022-04-15 11:44:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2253 transitions. [2022-04-15 11:44:20,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:20,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:20,057 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-15 11:44:20,058 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-15 11:44:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,132 INFO L93 Difference]: Finished difference Result 1573 states and 2253 transitions. [2022-04-15 11:44:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2253 transitions. [2022-04-15 11:44:20,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:20,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:20,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:20,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:20,135 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-15 11:44:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1953 transitions. [2022-04-15 11:44:20,209 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1953 transitions. Word has length 207 [2022-04-15 11:44:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:20,209 INFO L478 AbstractCegarLoop]: Abstraction has 1327 states and 1953 transitions. [2022-04-15 11:44:20,210 INFO L479 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-15 11:44:20,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1327 states and 1953 transitions. [2022-04-15 11:44:22,663 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-15 11:44:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1953 transitions. [2022-04-15 11:44:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-15 11:44:22,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:22,665 INFO L499 BasicCegarLoop]: 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-15 11:44:22,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:44:22,665 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1171434757, now seen corresponding path program 1 times [2022-04-15 11:44:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:22,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785074030] [2022-04-15 11:44:22,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1171434757, now seen corresponding path program 2 times [2022-04-15 11:44:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:22,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125619438] [2022-04-15 11:44:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:22,923 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-15 11:44:22,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {208593#true} assume true; {208593#true} is VALID [2022-04-15 11:44:22,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208593#true} {208593#true} #592#return; {208593#true} is VALID [2022-04-15 11:44:22,924 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-15 11:44:22,924 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-15 11:44:22,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {208593#true} assume true; {208593#true} is VALID [2022-04-15 11:44:22,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208593#true} {208593#true} #592#return; {208593#true} is VALID [2022-04-15 11:44:22,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {208593#true} call #t~ret159 := main(); {208593#true} is VALID [2022-04-15 11:44:22,924 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,925 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-15 11:44:22,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {208593#true} assume 12292 == #t~mem43;havoc #t~mem43; {208593#true} is VALID [2022-04-15 11:44:22,925 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-15 11:44:22,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {208593#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {208593#true} is VALID [2022-04-15 11:44:22,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {208593#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {208593#true} is VALID [2022-04-15 11:44:22,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {208593#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {208593#true} is VALID [2022-04-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,925 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-15 11:44:22,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-15 11:44:22,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {208593#true} assume 4368 == #t~mem48;havoc #t~mem48; {208593#true} is VALID [2022-04-15 11:44:22,926 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-15 11:44:22,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {208593#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208593#true} is VALID [2022-04-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-15 11:44:22,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,926 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-15 11:44:22,926 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-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {208593#true} assume 4384 == #t~mem50;havoc #t~mem50; {208593#true} is VALID [2022-04-15 11:44:22,927 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-15 11:44:22,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {208593#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208593#true} is VALID [2022-04-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {208593#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-15 11:44:22,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,927 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-15 11:44:22,927 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {208593#true} assume 4400 == #t~mem52;havoc #t~mem52; {208593#true} is VALID [2022-04-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {208593#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {208593#true} is VALID [2022-04-15 11:44:22,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {208593#true} assume !(~ret~0 <= 0); {208593#true} is VALID [2022-04-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 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-15 11:44:22,928 INFO L290 TraceCheckUtils]: 78: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-15 11:44:22,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,928 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {208593#true} assume 4416 == #t~mem54;havoc #t~mem54; {208593#true} is VALID [2022-04-15 11:44:22,929 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-15 11:44:22,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {208593#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {208593#true} is VALID [2022-04-15 11:44:22,929 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-15 11:44:22,929 INFO L290 TraceCheckUtils]: 96: Hoare triple {208593#true} assume !(0 == ~tmp___6~0); {208593#true} is VALID [2022-04-15 11:44:22,929 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-15 11:44:22,929 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-15 11:44:22,929 INFO L290 TraceCheckUtils]: 99: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-15 11:44:22,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 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-15 11:44:22,930 INFO L290 TraceCheckUtils]: 115: Hoare triple {208593#true} assume 4432 == #t~mem56;havoc #t~mem56; {208593#true} is VALID [2022-04-15 11:44:22,930 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-15 11:44:22,930 INFO L290 TraceCheckUtils]: 117: Hoare triple {208593#true} assume !(5 == ~blastFlag~0); {208593#true} is VALID [2022-04-15 11:44:22,930 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 INFO L290 TraceCheckUtils]: 121: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-15 11:44:22,931 INFO L290 TraceCheckUtils]: 122: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,931 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-15 11:44:22,932 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-15 11:44:22,932 INFO L290 TraceCheckUtils]: 139: Hoare triple {208593#true} assume 4448 == #t~mem58;havoc #t~mem58; {208593#true} is VALID [2022-04-15 11:44:22,932 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-15 11:44:22,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {208593#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {208593#true} is VALID [2022-04-15 11:44:22,932 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-15 11:44:22,932 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-15 11:44:22,933 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-15 11:44:22,933 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-15 11:44:22,934 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-15 11:44:22,934 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-15 11:44:22,934 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-15 11:44:22,935 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-15 11:44:22,935 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-15 11:44:22,935 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-15 11:44:22,936 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-15 11:44:22,936 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-15 11:44:22,936 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-15 11:44:22,937 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-15 11:44:22,937 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-15 11:44:22,937 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-15 11:44:22,938 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-15 11:44:22,938 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-15 11:44:22,938 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-15 11:44:22,939 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-15 11:44:22,939 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-15 11:44:22,939 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-15 11:44:22,940 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-15 11:44:22,940 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-15 11:44:22,940 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 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-15 11:44:22,941 INFO L290 TraceCheckUtils]: 181: Hoare triple {208594#false} assume 4352 == #t~mem74;havoc #t~mem74; {208594#false} is VALID [2022-04-15 11:44:22,941 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-15 11:44:22,942 INFO L290 TraceCheckUtils]: 183: Hoare triple {208594#false} assume !(~num1~0 > 0); {208594#false} is VALID [2022-04-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 INFO L290 TraceCheckUtils]: 187: Hoare triple {208594#false} ~skip~0 := 0; {208594#false} is VALID [2022-04-15 11:44:22,942 INFO L290 TraceCheckUtils]: 188: Hoare triple {208594#false} assume !false; {208594#false} is VALID [2022-04-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,942 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-15 11:44:22,943 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-15 11:44:22,943 INFO L290 TraceCheckUtils]: 203: Hoare triple {208594#false} assume 4432 == #t~mem56;havoc #t~mem56; {208594#false} is VALID [2022-04-15 11:44:22,943 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-15 11:44:22,943 INFO L290 TraceCheckUtils]: 205: Hoare triple {208594#false} assume 5 == ~blastFlag~0; {208594#false} is VALID [2022-04-15 11:44:22,943 INFO L290 TraceCheckUtils]: 206: Hoare triple {208594#false} assume !false; {208594#false} is VALID [2022-04-15 11:44:22,943 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-15 11:44:22,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:22,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125619438] [2022-04-15 11:44:22,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125619438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:22,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:22,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:22,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:22,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785074030] [2022-04-15 11:44:22,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785074030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:22,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:22,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555577770] [2022-04-15 11:44:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:22,945 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-15 11:44:22,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:22,945 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-15 11:44:23,036 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-15 11:44:23,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:23,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:23,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:23,037 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-15 11:44:25,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:26,614 INFO L93 Difference]: Finished difference Result 2842 states and 4161 transitions. [2022-04-15 11:44:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:26,614 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-15 11:44:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:26,614 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-15 11:44:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-04-15 11:44:26,616 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-15 11:44:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-04-15 11:44:26,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-04-15 11:44:26,887 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-15 11:44:26,989 INFO L225 Difference]: With dead ends: 2842 [2022-04-15 11:44:26,989 INFO L226 Difference]: Without dead ends: 1531 [2022-04-15 11:44:26,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:26,991 INFO L913 BasicCegarLoop]: 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-15 11:44:26,991 INFO L914 BasicCegarLoop]: 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-15 11:44:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-15 11:44:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1443. [2022-04-15 11:44:27,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:27,120 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-15 11:44:27,121 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-15 11:44:27,122 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-15 11:44:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:27,187 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2022-04-15 11:44:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2224 transitions. [2022-04-15 11:44:27,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:27,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:27,190 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-15 11:44:27,191 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-15 11:44:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:27,255 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2022-04-15 11:44:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2224 transitions. [2022-04-15 11:44:27,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:27,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:27,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:27,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:27,258 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-15 11:44:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2117 transitions. [2022-04-15 11:44:27,349 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2117 transitions. Word has length 207 [2022-04-15 11:44:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:27,349 INFO L478 AbstractCegarLoop]: Abstraction has 1443 states and 2117 transitions. [2022-04-15 11:44:27,349 INFO L479 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-15 11:44:27,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1443 states and 2117 transitions. [2022-04-15 11:44:30,015 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-15 11:44:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2117 transitions. [2022-04-15 11:44:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-15 11:44:30,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:30,017 INFO L499 BasicCegarLoop]: 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-15 11:44:30,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:44:30,017 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1117041859, now seen corresponding path program 1 times [2022-04-15 11:44:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933377438] [2022-04-15 11:44:30,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1117041859, now seen corresponding path program 2 times [2022-04-15 11:44:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225755709] [2022-04-15 11:44:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:30,226 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-15 11:44:30,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {220237#true} assume true; {220237#true} is VALID [2022-04-15 11:44:30,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220237#true} {220237#true} #592#return; {220237#true} is VALID [2022-04-15 11:44:30,227 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-15 11:44:30,227 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-15 11:44:30,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {220237#true} assume true; {220237#true} is VALID [2022-04-15 11:44:30,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220237#true} {220237#true} #592#return; {220237#true} is VALID [2022-04-15 11:44:30,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {220237#true} call #t~ret159 := main(); {220237#true} is VALID [2022-04-15 11:44:30,227 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-15 11:44:30,227 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-15 11:44:30,228 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-15 11:44:30,228 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-15 11:44:30,228 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-15 11:44:30,228 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-15 11:44:30,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,228 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-15 11:44:30,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {220237#true} assume 12292 == #t~mem43;havoc #t~mem43; {220237#true} is VALID [2022-04-15 11:44:30,228 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-15 11:44:30,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {220237#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {220237#true} is VALID [2022-04-15 11:44:30,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {220237#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {220237#true} is VALID [2022-04-15 11:44:30,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {220237#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {220237#true} is VALID [2022-04-15 11:44:30,228 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-15 11:44:30,228 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-15 11:44:30,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,229 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-15 11:44:30,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {220237#true} assume 4368 == #t~mem48;havoc #t~mem48; {220237#true} is VALID [2022-04-15 11:44:30,230 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-15 11:44:30,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {220237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220237#true} is VALID [2022-04-15 11:44:30,230 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-15 11:44:30,230 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-15 11:44:30,230 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-15 11:44:30,230 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-15 11:44:30,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-15 11:44:30,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,230 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-15 11:44:30,230 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-15 11:44:30,230 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-15 11:44:30,230 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-15 11:44:30,231 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-15 11:44:30,231 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-15 11:44:30,231 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-15 11:44:30,231 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-15 11:44:30,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {220237#true} assume 4384 == #t~mem50;havoc #t~mem50; {220237#true} is VALID [2022-04-15 11:44:30,231 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-15 11:44:30,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {220237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220237#true} is VALID [2022-04-15 11:44:30,231 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-15 11:44:30,231 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-15 11:44:30,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {220237#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-15 11:44:30,231 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-15 11:44:30,231 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-15 11:44:30,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-15 11:44:30,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 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-15 11:44:30,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {220237#true} assume 4400 == #t~mem52;havoc #t~mem52; {220237#true} is VALID [2022-04-15 11:44:30,233 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-15 11:44:30,233 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-15 11:44:30,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {220237#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {220237#true} is VALID [2022-04-15 11:44:30,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {220237#true} assume !(~ret~0 <= 0); {220237#true} is VALID [2022-04-15 11:44:30,233 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-15 11:44:30,233 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-15 11:44:30,233 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-15 11:44:30,233 INFO L290 TraceCheckUtils]: 78: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-15 11:44:30,233 INFO L290 TraceCheckUtils]: 79: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,233 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-15 11:44:30,233 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-15 11:44:30,233 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 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-15 11:44:30,234 INFO L290 TraceCheckUtils]: 92: Hoare triple {220237#true} assume 4416 == #t~mem54;havoc #t~mem54; {220237#true} is VALID [2022-04-15 11:44:30,234 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-15 11:44:30,234 INFO L290 TraceCheckUtils]: 94: Hoare triple {220237#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {220237#true} is VALID [2022-04-15 11:44:30,234 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-15 11:44:30,235 INFO L290 TraceCheckUtils]: 96: Hoare triple {220237#true} assume !(0 == ~tmp___6~0); {220237#true} is VALID [2022-04-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,235 INFO L290 TraceCheckUtils]: 99: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-15 11:44:30,235 INFO L290 TraceCheckUtils]: 100: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,235 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-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,236 INFO L290 TraceCheckUtils]: 115: Hoare triple {220237#true} assume 4432 == #t~mem56;havoc #t~mem56; {220237#true} is VALID [2022-04-15 11:44:30,236 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-15 11:44:30,236 INFO L290 TraceCheckUtils]: 117: Hoare triple {220237#true} assume !(5 == ~blastFlag~0); {220237#true} is VALID [2022-04-15 11:44:30,236 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-15 11:44:30,236 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-15 11:44:30,237 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-15 11:44:30,237 INFO L290 TraceCheckUtils]: 121: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-15 11:44:30,237 INFO L290 TraceCheckUtils]: 122: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,237 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-15 11:44:30,238 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-15 11:44:30,238 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-15 11:44:30,238 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-15 11:44:30,238 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-15 11:44:30,238 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-15 11:44:30,238 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-15 11:44:30,238 INFO L290 TraceCheckUtils]: 139: Hoare triple {220237#true} assume 4448 == #t~mem58;havoc #t~mem58; {220237#true} is VALID [2022-04-15 11:44:30,238 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-15 11:44:30,238 INFO L290 TraceCheckUtils]: 141: Hoare triple {220237#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {220237#true} is VALID [2022-04-15 11:44:30,238 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-15 11:44:30,239 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-15 11:44:30,239 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-15 11:44:30,240 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-15 11:44:30,240 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-15 11:44:30,240 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-15 11:44:30,241 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-15 11:44:30,241 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-15 11:44:30,241 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-15 11:44:30,241 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-15 11:44:30,242 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-15 11:44:30,242 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-15 11:44:30,242 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-15 11:44:30,242 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-15 11:44:30,243 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-15 11:44:30,243 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-15 11:44:30,243 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-15 11:44:30,243 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-15 11:44:30,244 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-15 11:44:30,244 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-15 11:44:30,244 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-15 11:44:30,245 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-15 11:44:30,245 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-15 11:44:30,245 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-15 11:44:30,245 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-15 11:44:30,246 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-15 11:44:30,246 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-15 11:44:30,246 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-15 11:44:30,246 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-15 11:44:30,247 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-15 11:44:30,247 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-15 11:44:30,247 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-15 11:44:30,247 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-15 11:44:30,248 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-15 11:44:30,248 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-15 11:44:30,248 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-15 11:44:30,249 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-15 11:44:30,249 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-15 11:44:30,249 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-15 11:44:30,249 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-15 11:44:30,250 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-15 11:44:30,250 INFO L290 TraceCheckUtils]: 183: Hoare triple {220238#false} assume !(~num1~0 > 0); {220238#false} is VALID [2022-04-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 INFO L290 TraceCheckUtils]: 187: Hoare triple {220238#false} ~skip~0 := 0; {220238#false} is VALID [2022-04-15 11:44:30,250 INFO L290 TraceCheckUtils]: 188: Hoare triple {220238#false} assume !false; {220238#false} is VALID [2022-04-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,250 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-15 11:44:30,251 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-15 11:44:30,251 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-15 11:44:30,251 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-15 11:44:30,251 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-15 11:44:30,251 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-15 11:44:30,251 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-15 11:44:30,251 INFO L290 TraceCheckUtils]: 203: Hoare triple {220238#false} assume 4432 == #t~mem56;havoc #t~mem56; {220238#false} is VALID [2022-04-15 11:44:30,251 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-15 11:44:30,251 INFO L290 TraceCheckUtils]: 205: Hoare triple {220238#false} assume 5 == ~blastFlag~0; {220238#false} is VALID [2022-04-15 11:44:30,251 INFO L290 TraceCheckUtils]: 206: Hoare triple {220238#false} assume !false; {220238#false} is VALID [2022-04-15 11:44:30,252 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-15 11:44:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:30,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225755709] [2022-04-15 11:44:30,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225755709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:30,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:30,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:30,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933377438] [2022-04-15 11:44:30,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933377438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:30,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:30,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288380512] [2022-04-15 11:44:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:30,254 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-15 11:44:30,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:30,254 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-15 11:44:30,367 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-15 11:44:30,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:30,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:30,367 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-15 11:44:32,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:34,107 INFO L93 Difference]: Finished difference Result 3096 states and 4489 transitions. [2022-04-15 11:44:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:34,108 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-15 11:44:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:34,108 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-15 11:44:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-15 11:44:34,110 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-15 11:44:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-15 11:44:34,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-15 11:44:34,431 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-15 11:44:34,552 INFO L225 Difference]: With dead ends: 3096 [2022-04-15 11:44:34,552 INFO L226 Difference]: Without dead ends: 1664 [2022-04-15 11:44:34,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:34,554 INFO L913 BasicCegarLoop]: 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-15 11:44:34,554 INFO L914 BasicCegarLoop]: 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-15 11:44:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-04-15 11:44:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1453. [2022-04-15 11:44:34,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:34,710 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-15 11:44:34,711 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-15 11:44:34,712 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-15 11:44:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:34,800 INFO L93 Difference]: Finished difference Result 1664 states and 2382 transitions. [2022-04-15 11:44:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2382 transitions. [2022-04-15 11:44:34,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:34,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:34,804 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-15 11:44:34,805 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-15 11:44:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:34,890 INFO L93 Difference]: Finished difference Result 1664 states and 2382 transitions. [2022-04-15 11:44:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2382 transitions. [2022-04-15 11:44:34,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:34,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:34,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:34,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:34,893 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-15 11:44:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2132 transitions. [2022-04-15 11:44:34,987 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2132 transitions. Word has length 207 [2022-04-15 11:44:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:34,987 INFO L478 AbstractCegarLoop]: Abstraction has 1453 states and 2132 transitions. [2022-04-15 11:44:34,987 INFO L479 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-15 11:44:34,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1453 states and 2132 transitions. [2022-04-15 11:44:37,731 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-15 11:44:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2132 transitions. [2022-04-15 11:44:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-15 11:44:37,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:37,733 INFO L499 BasicCegarLoop]: 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-15 11:44:37,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:44:37,733 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1085024224, now seen corresponding path program 1 times [2022-04-15 11:44:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:37,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494059015]