/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:09:36,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:09:36,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:09:36,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:09:36,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:09:36,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:09:36,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:09:36,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:09:36,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:09:36,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:09:36,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:09:36,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:09:36,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:09:36,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:09:36,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:09:36,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:09:36,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:09:36,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:09:36,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:09:36,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:09:36,738 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:09:36,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:09:36,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:09:36,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:09:36,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:09:36,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:09:36,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:09:36,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:09:36,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:09:36,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:09:36,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:09:36,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:09:36,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:09:36,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:09:36,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:09:36,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:09:36,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:09:36,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:09:36,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:09:36,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:09:36,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:09:36,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:09:36,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 16:09:36,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:09:36,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:09:36,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 16:09:36,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 16:09:36,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 16:09:36,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 16:09:36,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 16:09:36,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 16:09:36,778 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 16:09:36,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:09:36,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:09:36,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:09:36,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:09:36,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:09:36,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:09:36,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:09:36,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:09:36,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:09:36,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 16:09:36,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-07 16:09:36,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:09:36,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:09:36,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:09:36,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:09:36,984 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:09:36,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-07 16:09:37,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9819db2d0/fbc7607088184ff2a0d78d1db1be8f53/FLAG17570a661 [2022-04-07 16:09:37,494 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:09:37,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-2.c [2022-04-07 16:09:37,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9819db2d0/fbc7607088184ff2a0d78d1db1be8f53/FLAG17570a661 [2022-04-07 16:09:37,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9819db2d0/fbc7607088184ff2a0d78d1db1be8f53 [2022-04-07 16:09:37,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:09:37,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 16:09:37,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:09:37,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:09:37,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:09:37,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:09:37" (1/1) ... [2022-04-07 16:09:37,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bdaa9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:37, skipping insertion in model container [2022-04-07 16:09:37,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:09:37" (1/1) ... [2022-04-07 16:09:37,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:09:37,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:09:37,906 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.02.i.cil-2.c[65398,65411] [2022-04-07 16:09:37,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:09:37,936 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:09:38,003 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.02.i.cil-2.c[65398,65411] [2022-04-07 16:09:38,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:09:38,017 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:09:38,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38 WrapperNode [2022-04-07 16:09:38,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:09:38,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:09:38,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:09:38,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:09:38,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:09:38,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:09:38,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:09:38,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:09:38,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (1/1) ... [2022-04-07 16:09:38,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:09:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:09:38,145 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-07 16:09:38,151 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-07 16:09:38,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:09:38,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:09:38,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:09:38,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-07 16:09:38,182 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-07 16:09:38,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:09:38,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-07 16:09:38,183 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-07 16:09:38,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:09:38,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 16:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:09:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-07 16:09:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:09:38,362 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:09:38,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:09:39,656 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 16:09:39,998 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-07 16:09:39,998 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-07 16:09:40,018 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:09:40,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:09:40,026 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:09:40,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:09:40 BoogieIcfgContainer [2022-04-07 16:09:40,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:09:40,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:09:40,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:09:40,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:09:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:09:37" (1/3) ... [2022-04-07 16:09:40,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc4520d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:09:40, skipping insertion in model container [2022-04-07 16:09:40,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:38" (2/3) ... [2022-04-07 16:09:40,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc4520d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:09:40, skipping insertion in model container [2022-04-07 16:09:40,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:09:40" (3/3) ... [2022-04-07 16:09:40,041 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2022-04-07 16:09:40,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:09:40,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:09:40,091 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:09:40,096 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-07 16:09:40,096 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:09:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:09:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 16:09:40,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:40,118 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-07 16:09:40,118 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-07 16:09:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:40,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543029983] [2022-04-07 16:09:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:40,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-07 16:09:40,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-07 16:09:40,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-07 16:09:40,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:40,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-07 16:09:40,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-07 16:09:40,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-07 16:09:40,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-07 16:09:40,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-07 16:09:40,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-07 16:09:40,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:40,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:40,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:40,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:40,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:40,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-07 16:09:40,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-07 16:09:40,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-07 16:09:40,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-07 16:09:40,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-07 16:09:40,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-07 16:09:40,690 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-07 16:09:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:40,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543029983] [2022-04-07 16:09:40,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543029983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:40,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:40,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550228374] [2022-04-07 16:09:40,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:40,699 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-07 16:09:40,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:40,704 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-07 16:09:40,734 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-07 16:09:40,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:40,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:40,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:40,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:40,759 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:42,808 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-07 16:09:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:43,808 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-07 16:09:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:43,809 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-07 16:09:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:43,810 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-07 16:09:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:09:43,824 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-07 16:09:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:09:43,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-07 16:09:44,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:44,138 INFO L225 Difference]: With dead ends: 267 [2022-04-07 16:09:44,139 INFO L226 Difference]: Without dead ends: 122 [2022-04-07 16:09:44,141 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-07 16:09:44,143 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:44,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:09:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-07 16:09:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-07 16:09:44,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:44,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:44,170 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:44,170 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:44,183 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-07 16:09:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-07 16:09:44,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:44,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:44,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-07 16:09:44,185 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-07 16:09:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:44,192 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-07 16:09:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-07 16:09:44,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:44,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:44,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:44,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-07 16:09:44,205 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-07 16:09:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:44,205 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-07 16:09:44,205 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-07 16:09:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-07 16:09:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 16:09:44,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:44,207 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:44,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:09:44,208 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-07 16:09:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:44,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326910292] [2022-04-07 16:09:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:44,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:44,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {855#true} is VALID [2022-04-07 16:09:44,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-07 16:09:44,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-07 16:09:44,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:44,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {855#true} is VALID [2022-04-07 16:09:44,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-07 16:09:44,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-07 16:09:44,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#true} call #t~ret158 := main(); {855#true} is VALID [2022-04-07 16:09:44,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#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; {855#true} is VALID [2022-04-07 16:09:44,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {855#true} is VALID [2022-04-07 16:09:44,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= 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)))); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:44,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {856#false} is VALID [2022-04-07 16:09:44,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-04-07 16:09:44,433 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-07 16:09:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:44,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326910292] [2022-04-07 16:09:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326910292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:09:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939444790] [2022-04-07 16:09:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-07 16:09:44,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:44,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:44,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:44,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:09:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:09:44,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:09:44,469 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:46,490 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-07 16:09:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:47,069 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-07 16:09:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:09:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-07 16:09:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-07 16:09:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-07 16:09:47,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-07 16:09:47,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:47,421 INFO L225 Difference]: With dead ends: 326 [2022-04-07 16:09:47,422 INFO L226 Difference]: Without dead ends: 221 [2022-04-07 16:09:47,422 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-07 16:09:47,423 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:47,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:09:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-07 16:09:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-07 16:09:47,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:47,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,434 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,434 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:47,441 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-07 16:09:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-07 16:09:47,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:47,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:47,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-07 16:09:47,442 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-07 16:09:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:47,449 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-07 16:09:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-07 16:09:47,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:47,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:47,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:47,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-07 16:09:47,456 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-07 16:09:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:47,457 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-07 16:09:47,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-07 16:09:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 16:09:47,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:47,458 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:47,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:09:47,458 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-07 16:09:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:47,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131225097] [2022-04-07 16:09:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:47,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1948#true} is VALID [2022-04-07 16:09:47,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1948#true} assume true; {1948#true} is VALID [2022-04-07 16:09:47,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1948#true} {1948#true} #593#return; {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1955#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:47,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #593#return; {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret158 := main(); {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {1948#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; {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {1948#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1948#true} is VALID [2022-04-07 16:09:47,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {1948#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1948#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1948#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {1948#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#true} assume !false; {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {1948#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {1948#true} assume 12292 == #t~mem49;havoc #t~mem49; {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {1948#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {1948#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {1948#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1948#true} is VALID [2022-04-07 16:09:47,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {1948#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {1948#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {1948#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1948#true} is VALID [2022-04-07 16:09:47,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {1948#true} assume !(0 == ~tmp___4~0); {1948#true} is VALID [2022-04-07 16:09:47,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1948#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {1948#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {1948#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {1948#true} ~skip~0 := 0; {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {1948#true} assume !false; {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {1948#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {1948#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {1948#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {1948#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {1948#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {1948#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-07 16:09:47,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {1948#true} assume 4368 == #t~mem54;havoc #t~mem54; {1948#true} is VALID [2022-04-07 16:09:47,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {1948#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {1948#true} is VALID [2022-04-07 16:09:47,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {1948#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1948#true} is VALID [2022-04-07 16:09:47,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {1948#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:47,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-07 16:09:47,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {1954#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {1949#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {1949#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {1949#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {1949#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {1949#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {1949#false} assume 4432 == #t~mem62;havoc #t~mem62; {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {1949#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {1949#false} assume 5 == ~blastFlag~0; {1949#false} is VALID [2022-04-07 16:09:47,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2022-04-07 16:09:47,705 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-07 16:09:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:47,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131225097] [2022-04-07 16:09:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131225097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:47,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:47,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061225971] [2022-04-07 16:09:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:47,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-07 16:09:47,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:47,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:47,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:47,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:47,750 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:49,781 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-07 16:09:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:50,742 INFO L93 Difference]: Finished difference Result 362 states and 538 transitions. [2022-04-07 16:09:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-07 16:09:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-07 16:09:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-07 16:09:50,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-07 16:09:51,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:51,017 INFO L225 Difference]: With dead ends: 362 [2022-04-07 16:09:51,017 INFO L226 Difference]: Without dead ends: 257 [2022-04-07 16:09:51,020 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-07 16:09:51,021 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:51,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:09:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-07 16:09:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2022-04-07 16:09:51,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:51,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:51,030 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:51,031 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:51,036 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-07 16:09:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-07 16:09:51,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:51,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:51,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-07 16:09:51,038 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-07 16:09:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:51,043 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-07 16:09:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-07 16:09:51,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:51,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:51,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:51,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2022-04-07 16:09:51,049 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 59 [2022-04-07 16:09:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:51,049 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2022-04-07 16:09:51,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2022-04-07 16:09:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 16:09:51,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:51,050 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:51,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:09:51,051 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 2 times [2022-04-07 16:09:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:51,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977785337] [2022-04-07 16:09:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:51,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:51,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {3183#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {3176#true} is VALID [2022-04-07 16:09:51,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {3176#true} assume true; {3176#true} is VALID [2022-04-07 16:09:51,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3176#true} {3176#true} #593#return; {3176#true} is VALID [2022-04-07 16:09:51,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {3176#true} call ULTIMATE.init(); {3183#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:51,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {3183#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {3176#true} is VALID [2022-04-07 16:09:51,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {3176#true} assume true; {3176#true} is VALID [2022-04-07 16:09:51,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3176#true} {3176#true} #593#return; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {3176#true} call #t~ret158 := main(); {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {3176#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; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {3176#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {3176#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {3176#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {3176#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {3176#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {3176#true} assume !false; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {3176#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {3176#true} assume 12292 == #t~mem49;havoc #t~mem49; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {3176#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {3176#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {3176#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {3176#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {3176#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {3176#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {3176#true} assume !(0 == ~tmp___4~0); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {3176#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {3176#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {3176#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {3176#true} ~skip~0 := 0; {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {3176#true} assume !false; {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {3176#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {3176#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {3176#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {3176#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {3176#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-07 16:09:51,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {3176#true} assume 4368 == #t~mem54;havoc #t~mem54; {3176#true} is VALID [2022-04-07 16:09:51,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {3176#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {3176#true} is VALID [2022-04-07 16:09:51,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {3176#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3176#true} is VALID [2022-04-07 16:09:51,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {3176#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:51,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:51,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:51,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:51,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:51,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3182#(= |ssl3_connect_#t~mem49| 4384)} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {3182#(= |ssl3_connect_#t~mem49| 4384)} assume 12292 == #t~mem49;havoc #t~mem49; {3177#false} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {3177#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3177#false} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {3177#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {3177#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3177#false} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {3177#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {3177#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {3177#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {3177#false} assume !(0 == ~tmp___4~0); {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {3177#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {3177#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {3177#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {3177#false} ~skip~0 := 0; {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {3177#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {3177#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {3177#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {3177#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {3177#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {3177#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {3177#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {3177#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {3177#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {3177#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {3177#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {3177#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {3177#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,246 INFO L290 TraceCheckUtils]: 68: Hoare triple {3177#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-07 16:09:51,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {3177#false} assume 4432 == #t~mem62;havoc #t~mem62; {3177#false} is VALID [2022-04-07 16:09:51,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {3177#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {3177#false} is VALID [2022-04-07 16:09:51,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {3177#false} assume 5 == ~blastFlag~0; {3177#false} is VALID [2022-04-07 16:09:51,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2022-04-07 16:09:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:51,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977785337] [2022-04-07 16:09:51,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977785337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:51,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:51,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141518791] [2022-04-07 16:09:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:51,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-07 16:09:51,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:51,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:51,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:51,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:51,302 INFO L87 Difference]: Start difference. First operand 239 states and 355 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,325 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-07 16:09:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:54,222 INFO L93 Difference]: Finished difference Result 379 states and 566 transitions. [2022-04-07 16:09:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-07 16:09:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:09:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:09:54,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-07 16:09:54,466 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-07 16:09:54,470 INFO L225 Difference]: With dead ends: 379 [2022-04-07 16:09:54,470 INFO L226 Difference]: Without dead ends: 256 [2022-04-07 16:09:54,470 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-07 16:09:54,471 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 39 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:54,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 484 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:09:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-07 16:09:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2022-04-07 16:09:54,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:54,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,478 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,478 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:54,482 INFO L93 Difference]: Finished difference Result 256 states and 377 transitions. [2022-04-07 16:09:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-07 16:09:54,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:54,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:54,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-07 16:09:54,483 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-07 16:09:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:54,487 INFO L93 Difference]: Finished difference Result 256 states and 377 transitions. [2022-04-07 16:09:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-07 16:09:54,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:54,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:54,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:54,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 354 transitions. [2022-04-07 16:09:54,492 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 354 transitions. Word has length 73 [2022-04-07 16:09:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:54,492 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 354 transitions. [2022-04-07 16:09:54,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 354 transitions. [2022-04-07 16:09:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 16:09:54,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:54,493 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:54,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 16:09:54,493 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 1 times [2022-04-07 16:09:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:54,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289174945] [2022-04-07 16:09:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:54,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:54,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {4426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4419#true} is VALID [2022-04-07 16:09:54,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-07 16:09:54,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4419#true} {4419#true} #593#return; {4419#true} is VALID [2022-04-07 16:09:54,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {4419#true} call ULTIMATE.init(); {4426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:54,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {4426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4419#true} is VALID [2022-04-07 16:09:54,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-07 16:09:54,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4419#true} {4419#true} #593#return; {4419#true} is VALID [2022-04-07 16:09:54,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {4419#true} call #t~ret158 := main(); {4419#true} is VALID [2022-04-07 16:09:54,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {4419#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; {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {4419#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {4419#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {4419#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {4419#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {4419#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {4419#true} assume !false; {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {4419#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {4419#true} assume 12292 == #t~mem49;havoc #t~mem49; {4419#true} is VALID [2022-04-07 16:09:54,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {4419#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4419#true} is VALID [2022-04-07 16:09:54,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {4419#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {4419#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4419#true} is VALID [2022-04-07 16:09:54,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {4419#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {4419#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {4419#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4419#true} is VALID [2022-04-07 16:09:54,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {4419#true} assume !(0 == ~tmp___4~0); {4419#true} is VALID [2022-04-07 16:09:54,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {4419#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {4419#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {4419#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4419#true} is VALID [2022-04-07 16:09:54,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {4419#true} ~skip~0 := 0; {4419#true} is VALID [2022-04-07 16:09:54,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {4419#true} assume !false; {4419#true} is VALID [2022-04-07 16:09:54,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {4419#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {4419#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {4419#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {4419#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {4419#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-07 16:09:54,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {4419#true} assume 4368 == #t~mem54;havoc #t~mem54; {4419#true} is VALID [2022-04-07 16:09:54,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {4419#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4419#true} is VALID [2022-04-07 16:09:54,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {4419#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4419#true} is VALID [2022-04-07 16:09:54,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {4419#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:54,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4425#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-07 16:09:54,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {4425#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {4420#false} is VALID [2022-04-07 16:09:54,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {4420#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {4420#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4420#false} is VALID [2022-04-07 16:09:54,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {4420#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {4420#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {4420#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {4420#false} assume !(0 == ~tmp___4~0); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {4420#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {4420#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {4420#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {4420#false} ~skip~0 := 0; {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {4420#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {4420#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {4420#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {4420#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 59: Hoare triple {4420#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {4420#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {4420#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {4420#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {4420#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {4420#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {4420#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {4420#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {4420#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {4420#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {4420#false} assume 4432 == #t~mem62;havoc #t~mem62; {4420#false} is VALID [2022-04-07 16:09:54,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {4420#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4420#false} is VALID [2022-04-07 16:09:54,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {4420#false} assume 5 == ~blastFlag~0; {4420#false} is VALID [2022-04-07 16:09:54,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-04-07 16:09:54,696 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-07 16:09:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:54,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289174945] [2022-04-07 16:09:54,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289174945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:54,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:54,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278254040] [2022-04-07 16:09:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-07 16:09:54,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:54,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:54,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:54,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:54,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:54,746 INFO L87 Difference]: Start difference. First operand 239 states and 354 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:56,770 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-07 16:09:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:57,688 INFO L93 Difference]: Finished difference Result 644 states and 963 transitions. [2022-04-07 16:09:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-07 16:09:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:09:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:09:57,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-07 16:09:57,993 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-07 16:09:58,002 INFO L225 Difference]: With dead ends: 644 [2022-04-07 16:09:58,002 INFO L226 Difference]: Without dead ends: 421 [2022-04-07 16:09:58,003 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-07 16:09:58,005 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:58,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:09:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-07 16:09:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 263. [2022-04-07 16:09:58,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:58,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 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-07 16:09:58,035 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 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-07 16:09:58,036 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 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-07 16:09:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:58,043 INFO L93 Difference]: Finished difference Result 421 states and 626 transitions. [2022-04-07 16:09:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2022-04-07 16:09:58,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:58,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:58,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 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 421 states. [2022-04-07 16:09:58,045 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 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 421 states. [2022-04-07 16:09:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:58,054 INFO L93 Difference]: Finished difference Result 421 states and 626 transitions. [2022-04-07 16:09:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2022-04-07 16:09:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:58,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:58,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 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-07 16:09:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2022-04-07 16:09:58,060 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 73 [2022-04-07 16:09:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:58,060 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2022-04-07 16:09:58,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2022-04-07 16:09:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-07 16:09:58,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:58,061 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:58,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 16:09:58,062 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 1 times [2022-04-07 16:09:58,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:58,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692720000] [2022-04-07 16:09:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:58,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {6336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {6329#true} is VALID [2022-04-07 16:09:58,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {6329#true} assume true; {6329#true} is VALID [2022-04-07 16:09:58,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6329#true} {6329#true} #593#return; {6329#true} is VALID [2022-04-07 16:09:58,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {6329#true} call ULTIMATE.init(); {6336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:09:58,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {6336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {6329#true} is VALID [2022-04-07 16:09:58,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {6329#true} assume true; {6329#true} is VALID [2022-04-07 16:09:58,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6329#true} {6329#true} #593#return; {6329#true} is VALID [2022-04-07 16:09:58,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {6329#true} call #t~ret158 := main(); {6329#true} is VALID [2022-04-07 16:09:58,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {6329#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; {6329#true} is VALID [2022-04-07 16:09:58,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {6329#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {6329#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {6329#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {6329#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {6329#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {6329#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {6329#true} assume 12292 == #t~mem49;havoc #t~mem49; {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {6329#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {6329#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {6329#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {6329#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {6329#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {6329#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#true} assume !(0 == ~tmp___4~0); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {6329#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {6329#true} ~skip~0 := 0; {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {6329#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {6329#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {6329#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {6329#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {6329#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {6329#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {6329#true} assume 4368 == #t~mem54;havoc #t~mem54; {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {6329#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {6329#true} is VALID [2022-04-07 16:09:58,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {6329#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6329#true} is VALID [2022-04-07 16:09:58,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {6329#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:58,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6335#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-07 16:09:58,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {6335#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {6330#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {6330#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {6330#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {6330#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {6330#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {6330#false} assume !(0 == ~tmp___4~0); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {6330#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {6330#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {6330#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {6330#false} ~skip~0 := 0; {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {6330#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {6330#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {6330#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {6330#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {6330#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {6330#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {6330#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {6330#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {6330#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {6330#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {6330#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {6330#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {6330#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {6330#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {6330#false} assume 4432 == #t~mem62;havoc #t~mem62; {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {6330#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {6330#false} is VALID [2022-04-07 16:09:58,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {6330#false} assume 5 == ~blastFlag~0; {6330#false} is VALID [2022-04-07 16:09:58,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2022-04-07 16:09:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692720000] [2022-04-07 16:09:58,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692720000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:58,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:58,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920489206] [2022-04-07 16:09:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-07 16:09:58,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:58,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:58,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:58,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:58,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:58,338 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:00,360 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-07 16:10:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,268 INFO L93 Difference]: Finished difference Result 415 states and 616 transitions. [2022-04-07 16:10:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-07 16:10:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-07 16:10:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-07 16:10:01,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-07 16:10:01,516 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-07 16:10:01,520 INFO L225 Difference]: With dead ends: 415 [2022-04-07 16:10:01,520 INFO L226 Difference]: Without dead ends: 280 [2022-04-07 16:10:01,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:10:01,521 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:01,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-07 16:10:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-07 16:10:01,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:01,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,527 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,528 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,532 INFO L93 Difference]: Finished difference Result 280 states and 411 transitions. [2022-04-07 16:10:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2022-04-07 16:10:01,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:01,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:01,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-07 16:10:01,533 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-07 16:10:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,537 INFO L93 Difference]: Finished difference Result 280 states and 411 transitions. [2022-04-07 16:10:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2022-04-07 16:10:01,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:01,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:01,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:01,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2022-04-07 16:10:01,542 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 74 [2022-04-07 16:10:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:01,542 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2022-04-07 16:10:01,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2022-04-07 16:10:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 16:10:01,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:01,543 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:01,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 16:10:01,543 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 1 times [2022-04-07 16:10:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929655868] [2022-04-07 16:10:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:01,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {7692#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7685#true} is VALID [2022-04-07 16:10:01,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {7685#true} assume true; {7685#true} is VALID [2022-04-07 16:10:01,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7685#true} {7685#true} #593#return; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {7685#true} call ULTIMATE.init(); {7692#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:01,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {7692#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {7685#true} assume true; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7685#true} {7685#true} #593#return; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {7685#true} call #t~ret158 := main(); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {7685#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; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {7685#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {7685#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {7685#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {7685#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {7685#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {7685#true} assume !false; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {7685#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {7685#true} assume 12292 == #t~mem49;havoc #t~mem49; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {7685#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {7685#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {7685#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {7685#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {7685#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {7685#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {7685#true} assume !(0 == ~tmp___4~0); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {7685#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {7685#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {7685#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {7685#true} ~skip~0 := 0; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {7685#true} assume !false; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {7685#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {7685#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {7685#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {7685#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {7685#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {7685#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {7685#true} assume 4368 == #t~mem54;havoc #t~mem54; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {7685#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7685#true} is VALID [2022-04-07 16:10:01,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {7685#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7685#true} is VALID [2022-04-07 16:10:01,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {7685#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:01,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7691#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-07 16:10:01,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {7691#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {7686#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {7686#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {7686#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {7686#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {7686#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {7686#false} assume !(0 == ~tmp___4~0); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {7686#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {7686#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {7686#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {7686#false} ~skip~0 := 0; {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {7686#false} assume !false; {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {7686#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {7686#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {7686#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 60: Hoare triple {7686#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {7686#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {7686#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {7686#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {7686#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {7686#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {7686#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {7686#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {7686#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {7686#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {7686#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {7686#false} assume 4432 == #t~mem62;havoc #t~mem62; {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {7686#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {7686#false} assume 5 == ~blastFlag~0; {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {7686#false} assume !false; {7686#false} is VALID [2022-04-07 16:10:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:10:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:01,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929655868] [2022-04-07 16:10:01,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929655868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:01,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:01,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267680653] [2022-04-07 16:10:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:01,727 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-07 16:10:01,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:01,727 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-07 16:10:01,780 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-07 16:10:01,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:01,781 INFO L87 Difference]: Start difference. First operand 263 states and 388 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-07 16:10:03,802 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-07 16:10:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:04,702 INFO L93 Difference]: Finished difference Result 415 states and 614 transitions. [2022-04-07 16:10:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:04,702 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-07 16:10:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:04,703 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-07 16:10:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-07 16:10:04,705 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-07 16:10:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-07 16:10:04,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-07 16:10:04,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:04,985 INFO L225 Difference]: With dead ends: 415 [2022-04-07 16:10:04,986 INFO L226 Difference]: Without dead ends: 280 [2022-04-07 16:10:04,986 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-07 16:10:04,986 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 33 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:04,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-07 16:10:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-07 16:10:04,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:04,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,992 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,992 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:04,996 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-07 16:10:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-07 16:10:04,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:04,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:04,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-07 16:10:04,998 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-07 16:10:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:05,002 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-07 16:10:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-07 16:10:05,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:05,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:05,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:05,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-04-07 16:10:05,007 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 75 [2022-04-07 16:10:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:05,007 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-04-07 16:10:05,007 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-07 16:10:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-04-07 16:10:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 16:10:05,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:05,008 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:05,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 16:10:05,008 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 1 times [2022-04-07 16:10:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:05,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737895080] [2022-04-07 16:10:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:05,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {9048#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9041#true} is VALID [2022-04-07 16:10:05,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {9041#true} assume true; {9041#true} is VALID [2022-04-07 16:10:05,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9041#true} {9041#true} #593#return; {9041#true} is VALID [2022-04-07 16:10:05,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {9041#true} call ULTIMATE.init(); {9048#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:05,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {9048#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {9041#true} assume true; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9041#true} {9041#true} #593#return; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {9041#true} call #t~ret158 := main(); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {9041#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; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {9041#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {9041#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {9041#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {9041#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {9041#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {9041#true} assume !false; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {9041#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#true} assume 12292 == #t~mem49;havoc #t~mem49; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {9041#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {9041#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {9041#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {9041#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {9041#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9041#true} is VALID [2022-04-07 16:10:05,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#true} assume !(0 == ~tmp___4~0); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {9041#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {9041#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {9041#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {9041#true} ~skip~0 := 0; {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {9041#true} assume !false; {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {9041#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {9041#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {9041#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {9041#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#true} assume 4368 == #t~mem54;havoc #t~mem54; {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9041#true} is VALID [2022-04-07 16:10:05,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {9041#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9041#true} is VALID [2022-04-07 16:10:05,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9047#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {9047#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {9042#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {9042#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {9042#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {9042#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {9042#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {9042#false} assume !(0 == ~tmp___4~0); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {9042#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {9042#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {9042#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {9042#false} ~skip~0 := 0; {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {9042#false} assume !false; {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {9042#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {9042#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,178 INFO L290 TraceCheckUtils]: 60: Hoare triple {9042#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {9042#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {9042#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {9042#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {9042#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 65: Hoare triple {9042#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 66: Hoare triple {9042#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 67: Hoare triple {9042#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 68: Hoare triple {9042#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {9042#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {9042#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {9042#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {9042#false} assume 4432 == #t~mem62;havoc #t~mem62; {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {9042#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {9042#false} assume 5 == ~blastFlag~0; {9042#false} is VALID [2022-04-07 16:10:05,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {9042#false} assume !false; {9042#false} is VALID [2022-04-07 16:10:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:10:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:05,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737895080] [2022-04-07 16:10:05,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737895080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:05,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:05,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384995167] [2022-04-07 16:10:05,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:05,181 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-07 16:10:05,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:05,181 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-07 16:10:05,228 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-07 16:10:05,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:05,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:05,228 INFO L87 Difference]: Start difference. First operand 263 states and 387 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-07 16:10:07,248 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-07 16:10:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,188 INFO L93 Difference]: Finished difference Result 668 states and 991 transitions. [2022-04-07 16:10:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:08,188 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-07 16:10:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:08,189 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-07 16:10:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:08,191 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-07 16:10:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:08,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:10:08,527 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-07 16:10:08,535 INFO L225 Difference]: With dead ends: 668 [2022-04-07 16:10:08,535 INFO L226 Difference]: Without dead ends: 421 [2022-04-07 16:10:08,536 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-07 16:10:08,536 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:08,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-07 16:10:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 269. [2022-04-07 16:10:08,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:08,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,543 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,543 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,550 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2022-04-07 16:10:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2022-04-07 16:10:08,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:08,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:08,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 421 states. [2022-04-07 16:10:08,553 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 421 states. [2022-04-07 16:10:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,560 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2022-04-07 16:10:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2022-04-07 16:10:08,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:08,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:08,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:08,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 396 transitions. [2022-04-07 16:10:08,565 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 396 transitions. Word has length 76 [2022-04-07 16:10:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:08,565 INFO L478 AbstractCegarLoop]: Abstraction has 269 states and 396 transitions. [2022-04-07 16:10:08,565 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-07 16:10:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 396 transitions. [2022-04-07 16:10:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 16:10:08,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:08,568 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:08,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 16:10:08,569 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 1 times [2022-04-07 16:10:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:08,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844868272] [2022-04-07 16:10:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:08,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {10989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {10983#true} is VALID [2022-04-07 16:10:08,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {10983#true} assume true; {10983#true} is VALID [2022-04-07 16:10:08,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10983#true} {10983#true} #593#return; {10983#true} is VALID [2022-04-07 16:10:08,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {10983#true} call ULTIMATE.init(); {10989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:08,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {10989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {10983#true} is VALID [2022-04-07 16:10:08,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {10983#true} assume true; {10983#true} is VALID [2022-04-07 16:10:08,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10983#true} {10983#true} #593#return; {10983#true} is VALID [2022-04-07 16:10:08,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {10983#true} call #t~ret158 := main(); {10983#true} is VALID [2022-04-07 16:10:08,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {10983#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; {10983#true} is VALID [2022-04-07 16:10:08,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {10983#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {10983#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {10983#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {10983#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {10983#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {10983#true} assume !false; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {10983#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {10983#true} assume 12292 == #t~mem49;havoc #t~mem49; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {10983#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {10983#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {10983#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {10983#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {10983#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {10983#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {10983#true} assume !(0 == ~tmp___4~0); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {10983#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {10983#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {10983#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {10983#true} ~skip~0 := 0; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {10983#true} assume !false; {10983#true} is VALID [2022-04-07 16:10:08,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {10983#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {10983#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {10983#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {10983#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {10983#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {10983#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {10983#true} assume 4368 == #t~mem54;havoc #t~mem54; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {10983#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {10983#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {10983#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {10983#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {10983#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {10983#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {10983#true} ~skip~0 := 0; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {10983#true} assume !false; {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {10983#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {10983#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {10983#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {10983#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {10983#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {10983#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {10983#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {10983#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-07 16:10:08,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {10983#true} assume 4384 == #t~mem56;havoc #t~mem56; {10983#true} is VALID [2022-04-07 16:10:08,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {10983#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {10983#true} is VALID [2022-04-07 16:10:08,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {10983#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:08,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {10984#false} is VALID [2022-04-07 16:10:08,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {10984#false} assume !false; {10984#false} is VALID [2022-04-07 16:10:08,732 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-07 16:10:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:08,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844868272] [2022-04-07 16:10:08,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844868272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:08,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:08,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734456502] [2022-04-07 16:10:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-07 16:10:08,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:08,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:08,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:08,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:08,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:08,784 INFO L87 Difference]: Start difference. First operand 269 states and 396 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:10,802 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-07 16:10:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:11,716 INFO L93 Difference]: Finished difference Result 542 states and 806 transitions. [2022-04-07 16:10:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:11,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-07 16:10:11,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-07 16:10:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-07 16:10:11,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-07 16:10:12,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:12,057 INFO L225 Difference]: With dead ends: 542 [2022-04-07 16:10:12,057 INFO L226 Difference]: Without dead ends: 404 [2022-04-07 16:10:12,058 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-07 16:10:12,058 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:12,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-04-07 16:10:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2022-04-07 16:10:12,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:12,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 404 states. Second operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,067 INFO L74 IsIncluded]: Start isIncluded. First operand 404 states. Second operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,067 INFO L87 Difference]: Start difference. First operand 404 states. Second operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,074 INFO L93 Difference]: Finished difference Result 404 states and 594 transitions. [2022-04-07 16:10:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 594 transitions. [2022-04-07 16:10:12,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:12,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:12,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-07 16:10:12,076 INFO L87 Difference]: Start difference. First operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-07 16:10:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,083 INFO L93 Difference]: Finished difference Result 404 states and 594 transitions. [2022-04-07 16:10:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 594 transitions. [2022-04-07 16:10:12,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:12,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:12,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:12,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 594 transitions. [2022-04-07 16:10:12,092 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 594 transitions. Word has length 77 [2022-04-07 16:10:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:12,092 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 594 transitions. [2022-04-07 16:10:12,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 594 transitions. [2022-04-07 16:10:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 16:10:12,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:12,093 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:12,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 16:10:12,093 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 1 times [2022-04-07 16:10:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:12,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564183136] [2022-04-07 16:10:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:12,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {12891#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {12885#true} is VALID [2022-04-07 16:10:12,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {12885#true} assume true; {12885#true} is VALID [2022-04-07 16:10:12,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12885#true} {12885#true} #593#return; {12885#true} is VALID [2022-04-07 16:10:12,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {12885#true} call ULTIMATE.init(); {12891#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:12,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {12891#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {12885#true} assume true; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12885#true} {12885#true} #593#return; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {12885#true} call #t~ret158 := main(); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {12885#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; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {12885#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {12885#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {12885#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {12885#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {12885#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {12885#true} assume !false; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {12885#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {12885#true} assume 12292 == #t~mem49;havoc #t~mem49; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {12885#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {12885#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {12885#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {12885#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {12885#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {12885#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {12885#true} assume !(0 == ~tmp___4~0); {12885#true} is VALID [2022-04-07 16:10:12,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {12885#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {12885#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {12885#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {12885#true} ~skip~0 := 0; {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {12885#true} assume !false; {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {12885#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {12885#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {12885#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {12885#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {12885#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {12885#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-07 16:10:12,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {12885#true} assume 4368 == #t~mem54;havoc #t~mem54; {12885#true} is VALID [2022-04-07 16:10:12,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {12885#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {12885#true} is VALID [2022-04-07 16:10:12,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {12885#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !false; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {12886#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {12886#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {12886#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 55: Hoare triple {12886#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {12886#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {12886#false} ~skip~0 := 0; {12886#false} is VALID [2022-04-07 16:10:12,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {12886#false} assume !false; {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 59: Hoare triple {12886#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {12886#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {12886#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {12886#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {12886#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {12886#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {12886#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 66: Hoare triple {12886#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 67: Hoare triple {12886#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 68: Hoare triple {12886#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {12886#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {12886#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {12886#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {12886#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {12886#false} assume 4432 == #t~mem62;havoc #t~mem62; {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {12886#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {12886#false} assume 5 == ~blastFlag~0; {12886#false} is VALID [2022-04-07 16:10:12,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {12886#false} assume !false; {12886#false} is VALID [2022-04-07 16:10:12,251 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-07 16:10:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564183136] [2022-04-07 16:10:12,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564183136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:12,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:12,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012817316] [2022-04-07 16:10:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-07 16:10:12,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:12,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,307 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-07 16:10:12,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:12,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:12,307 INFO L87 Difference]: Start difference. First operand 404 states and 594 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:14,324 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-07 16:10:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:14,869 INFO L93 Difference]: Finished difference Result 702 states and 1034 transitions. [2022-04-07 16:10:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-07 16:10:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-07 16:10:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-07 16:10:14,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 369 transitions. [2022-04-07 16:10:15,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:15,107 INFO L225 Difference]: With dead ends: 702 [2022-04-07 16:10:15,107 INFO L226 Difference]: Without dead ends: 429 [2022-04-07 16:10:15,107 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-07 16:10:15,108 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:15,109 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 358 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:10:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-07 16:10:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2022-04-07 16:10:15,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:15,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,117 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,118 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:15,125 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-07 16:10:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-07 16:10:15,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:15,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:15,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-07 16:10:15,127 INFO L87 Difference]: Start difference. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-07 16:10:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:15,135 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-07 16:10:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-07 16:10:15,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:15,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:15,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:15,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 627 transitions. [2022-04-07 16:10:15,144 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 627 transitions. Word has length 77 [2022-04-07 16:10:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:15,145 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 627 transitions. [2022-04-07 16:10:15,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-07 16:10:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 16:10:15,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:15,146 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:15,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 16:10:15,146 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 1 times [2022-04-07 16:10:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:15,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526886520] [2022-04-07 16:10:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:15,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {15052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15046#true} is VALID [2022-04-07 16:10:15,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {15046#true} assume true; {15046#true} is VALID [2022-04-07 16:10:15,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15046#true} {15046#true} #593#return; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {15046#true} call ULTIMATE.init(); {15052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:15,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {15052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {15046#true} assume true; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15046#true} {15046#true} #593#return; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {15046#true} call #t~ret158 := main(); {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {15046#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; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {15046#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {15046#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {15046#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {15046#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {15046#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {15046#true} assume 12292 == #t~mem49;havoc #t~mem49; {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {15046#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {15046#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {15046#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {15046#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {15046#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {15046#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15046#true} is VALID [2022-04-07 16:10:15,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {15046#true} assume !(0 == ~tmp___4~0); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {15046#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {15046#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {15046#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {15046#true} ~skip~0 := 0; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {15046#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {15046#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {15046#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {15046#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {15046#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {15046#true} assume 4368 == #t~mem54;havoc #t~mem54; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {15046#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {15046#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {15046#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {15046#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {15046#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {15046#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {15046#true} ~skip~0 := 0; {15046#true} is VALID [2022-04-07 16:10:15,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {15046#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {15046#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {15046#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {15046#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {15046#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {15046#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {15046#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {15046#true} assume 4384 == #t~mem56;havoc #t~mem56; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {15046#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {15046#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {15046#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {15046#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {15046#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {15046#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {15046#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {15046#true} ~skip~0 := 0; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {15046#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {15046#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {15046#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {15046#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {15046#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {15046#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {15046#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 67: Hoare triple {15046#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {15046#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {15046#true} assume 4400 == #t~mem58;havoc #t~mem58; {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 70: Hoare triple {15046#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {15046#true} is VALID [2022-04-07 16:10:15,342 INFO L290 TraceCheckUtils]: 71: Hoare triple {15046#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15046#true} is VALID [2022-04-07 16:10:15,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {15046#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {15051#(= 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); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,354 INFO L290 TraceCheckUtils]: 78: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,355 INFO L290 TraceCheckUtils]: 83: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,356 INFO L290 TraceCheckUtils]: 86: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,356 INFO L290 TraceCheckUtils]: 87: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,356 INFO L290 TraceCheckUtils]: 88: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,356 INFO L290 TraceCheckUtils]: 89: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:15,358 INFO L290 TraceCheckUtils]: 95: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15047#false} is VALID [2022-04-07 16:10:15,358 INFO L290 TraceCheckUtils]: 96: Hoare triple {15047#false} assume !false; {15047#false} is VALID [2022-04-07 16:10:15,358 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-07 16:10:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:15,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526886520] [2022-04-07 16:10:15,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526886520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:15,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:15,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598363655] [2022-04-07 16:10:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-07 16:10:15,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:15,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,412 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-07 16:10:15,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:15,413 INFO L87 Difference]: Start difference. First operand 429 states and 627 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:17,431 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-07 16:10:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:18,352 INFO L93 Difference]: Finished difference Result 861 states and 1267 transitions. [2022-04-07 16:10:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:18,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-07 16:10:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-07 16:10:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-07 16:10:18,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-07 16:10:18,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:18,660 INFO L225 Difference]: With dead ends: 861 [2022-04-07 16:10:18,660 INFO L226 Difference]: Without dead ends: 563 [2022-04-07 16:10:18,661 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-07 16:10:18,661 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:18,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-07 16:10:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-04-07 16:10:18,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:18,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,671 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,672 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:18,682 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-07 16:10:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-07 16:10:18,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:18,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:18,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 563 states. [2022-04-07 16:10:18,700 INFO L87 Difference]: Start difference. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 563 states. [2022-04-07 16:10:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:18,710 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-07 16:10:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-07 16:10:18,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:18,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:18,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:18,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 824 transitions. [2022-04-07 16:10:18,723 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 824 transitions. Word has length 97 [2022-04-07 16:10:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:18,723 INFO L478 AbstractCegarLoop]: Abstraction has 563 states and 824 transitions. [2022-04-07 16:10:18,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-07 16:10:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-07 16:10:18,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:18,726 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:18,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 16:10:18,726 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-07 16:10:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:18,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350211424] [2022-04-07 16:10:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:18,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {17813#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17807#true} is VALID [2022-04-07 16:10:18,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {17807#true} assume true; {17807#true} is VALID [2022-04-07 16:10:18,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17807#true} {17807#true} #593#return; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {17807#true} call ULTIMATE.init(); {17813#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:18,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {17813#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {17807#true} assume true; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17807#true} {17807#true} #593#return; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {17807#true} call #t~ret158 := main(); {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {17807#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; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {17807#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {17807#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {17807#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {17807#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {17807#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {17807#true} assume !false; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {17807#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {17807#true} assume 12292 == #t~mem49;havoc #t~mem49; {17807#true} is VALID [2022-04-07 16:10:18,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {17807#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {17807#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {17807#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {17807#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {17807#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {17807#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {17807#true} assume !(0 == ~tmp___4~0); {17807#true} is VALID [2022-04-07 16:10:18,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {17807#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {17807#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {17807#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {17807#true} ~skip~0 := 0; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {17807#true} assume !false; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {17807#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {17807#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {17807#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {17807#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {17807#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {17807#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {17807#true} assume 4368 == #t~mem54;havoc #t~mem54; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {17807#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {17807#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {17807#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {17807#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {17807#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {17807#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {17807#true} ~skip~0 := 0; {17807#true} is VALID [2022-04-07 16:10:18,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {17807#true} assume !false; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {17807#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {17807#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {17807#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {17807#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {17807#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {17807#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {17807#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {17807#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {17807#true} assume 4384 == #t~mem56;havoc #t~mem56; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {17807#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {17807#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {17807#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {17807#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {17807#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {17807#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {17807#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {17807#true} ~skip~0 := 0; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {17807#true} assume !false; {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {17807#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {17807#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {17807#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {17807#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {17807#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {17807#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {17807#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {17807#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {17807#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {17807#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {17807#true} assume 4400 == #t~mem58;havoc #t~mem58; {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {17807#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {17807#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {17807#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {17807#true} assume !(~ret~0 <= 0); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {17807#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {17807#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {17807#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {17807#true} ~skip~0 := 0; {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 78: Hoare triple {17807#true} assume !false; {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 79: Hoare triple {17807#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,925 INFO L290 TraceCheckUtils]: 80: Hoare triple {17807#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 81: Hoare triple {17807#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 82: Hoare triple {17807#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 83: Hoare triple {17807#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {17807#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 85: Hoare triple {17807#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 86: Hoare triple {17807#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 87: Hoare triple {17807#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 88: Hoare triple {17807#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 89: Hoare triple {17807#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 90: Hoare triple {17807#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 91: Hoare triple {17807#true} assume 4416 == #t~mem60;havoc #t~mem60; {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 92: Hoare triple {17807#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {17807#true} is VALID [2022-04-07 16:10:18,926 INFO L290 TraceCheckUtils]: 93: Hoare triple {17807#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,927 INFO L290 TraceCheckUtils]: 94: Hoare triple {17812#(= 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); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,927 INFO L290 TraceCheckUtils]: 95: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,927 INFO L290 TraceCheckUtils]: 96: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,927 INFO L290 TraceCheckUtils]: 97: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,928 INFO L290 TraceCheckUtils]: 98: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,928 INFO L290 TraceCheckUtils]: 99: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !false; {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,928 INFO L290 TraceCheckUtils]: 100: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,928 INFO L290 TraceCheckUtils]: 101: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,928 INFO L290 TraceCheckUtils]: 102: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,929 INFO L290 TraceCheckUtils]: 103: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,929 INFO L290 TraceCheckUtils]: 104: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,929 INFO L290 TraceCheckUtils]: 105: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,929 INFO L290 TraceCheckUtils]: 106: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,929 INFO L290 TraceCheckUtils]: 107: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,930 INFO L290 TraceCheckUtils]: 108: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,930 INFO L290 TraceCheckUtils]: 109: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,930 INFO L290 TraceCheckUtils]: 110: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,930 INFO L290 TraceCheckUtils]: 111: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,931 INFO L290 TraceCheckUtils]: 113: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,931 INFO L290 TraceCheckUtils]: 114: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,931 INFO L290 TraceCheckUtils]: 115: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17812#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:18,931 INFO L290 TraceCheckUtils]: 116: Hoare triple {17812#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {17808#false} is VALID [2022-04-07 16:10:18,931 INFO L290 TraceCheckUtils]: 117: Hoare triple {17808#false} assume !false; {17808#false} is VALID [2022-04-07 16:10:18,932 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-07 16:10:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350211424] [2022-04-07 16:10:18,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350211424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:18,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:18,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421531570] [2022-04-07 16:10:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-07 16:10:18,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:18,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:18,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:18,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:18,985 INFO L87 Difference]: Start difference. First operand 563 states and 824 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:21,001 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-07 16:10:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:21,894 INFO L93 Difference]: Finished difference Result 1111 states and 1635 transitions. [2022-04-07 16:10:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-07 16:10:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:10:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:10:21,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-07 16:10:22,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:22,208 INFO L225 Difference]: With dead ends: 1111 [2022-04-07 16:10:22,208 INFO L226 Difference]: Without dead ends: 679 [2022-04-07 16:10:22,209 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-07 16:10:22,209 INFO L913 BasicCegarLoop]: 313 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:22,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 475 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-04-07 16:10:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2022-04-07 16:10:22,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:22,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 679 states. Second operand has 679 states, 674 states have (on average 1.470326409495549) internal successors, (991), 674 states have internal predecessors, (991), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,220 INFO L74 IsIncluded]: Start isIncluded. First operand 679 states. Second operand has 679 states, 674 states have (on average 1.470326409495549) internal successors, (991), 674 states have internal predecessors, (991), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,220 INFO L87 Difference]: Start difference. First operand 679 states. Second operand has 679 states, 674 states have (on average 1.470326409495549) internal successors, (991), 674 states have internal predecessors, (991), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:22,233 INFO L93 Difference]: Finished difference Result 679 states and 995 transitions. [2022-04-07 16:10:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 995 transitions. [2022-04-07 16:10:22,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:22,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:22,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 674 states have (on average 1.470326409495549) internal successors, (991), 674 states have internal predecessors, (991), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 679 states. [2022-04-07 16:10:22,236 INFO L87 Difference]: Start difference. First operand has 679 states, 674 states have (on average 1.470326409495549) internal successors, (991), 674 states have internal predecessors, (991), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 679 states. [2022-04-07 16:10:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:22,249 INFO L93 Difference]: Finished difference Result 679 states and 995 transitions. [2022-04-07 16:10:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 995 transitions. [2022-04-07 16:10:22,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:22,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:22,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:22,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 674 states have (on average 1.470326409495549) internal successors, (991), 674 states have internal predecessors, (991), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 995 transitions. [2022-04-07 16:10:22,266 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 995 transitions. Word has length 118 [2022-04-07 16:10:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:22,266 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 995 transitions. [2022-04-07 16:10:22,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 995 transitions. [2022-04-07 16:10:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-07 16:10:22,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:22,268 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:22,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 16:10:22,268 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -383649488, now seen corresponding path program 1 times [2022-04-07 16:10:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:22,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915904814] [2022-04-07 16:10:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:22,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {21225#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21218#true} is VALID [2022-04-07 16:10:22,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-07 16:10:22,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21218#true} {21218#true} #593#return; {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {21218#true} call ULTIMATE.init(); {21225#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:22,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {21225#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {21218#true} assume true; {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21218#true} {21218#true} #593#return; {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {21218#true} call #t~ret158 := main(); {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {21218#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; {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {21218#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {21218#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {21218#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {21218#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {21218#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21218#true} is VALID [2022-04-07 16:10:22,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {21218#true} assume !false; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {21218#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {21218#true} assume 12292 == #t~mem49;havoc #t~mem49; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {21218#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {21218#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {21218#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {21218#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {21218#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {21218#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {21218#true} assume !(0 == ~tmp___4~0); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {21218#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {21218#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {21218#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {21218#true} ~skip~0 := 0; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {21218#true} assume !false; {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {21218#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {21218#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {21218#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {21218#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {21218#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {21218#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {21218#true} assume 4368 == #t~mem54;havoc #t~mem54; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {21218#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {21218#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {21218#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {21218#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {21218#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {21218#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {21218#true} ~skip~0 := 0; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {21218#true} assume !false; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {21218#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {21218#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {21218#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {21218#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {21218#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {21218#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {21218#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {21218#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {21218#true} assume 4384 == #t~mem56;havoc #t~mem56; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {21218#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21218#true} is VALID [2022-04-07 16:10:22,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {21218#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {21218#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {21218#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {21218#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {21218#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {21218#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {21218#true} ~skip~0 := 0; {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {21218#true} assume !false; {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {21218#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {21218#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {21218#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {21218#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {21218#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {21218#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {21218#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {21218#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {21218#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {21218#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {21218#true} assume 4400 == #t~mem58;havoc #t~mem58; {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {21218#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {21218#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {21218#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {21218#true} assume !(~ret~0 <= 0); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {21218#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {21218#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 76: Hoare triple {21218#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {21218#true} ~skip~0 := 0; {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 78: Hoare triple {21218#true} assume !false; {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 79: Hoare triple {21218#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {21218#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {21218#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 82: Hoare triple {21218#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 83: Hoare triple {21218#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 84: Hoare triple {21218#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 85: Hoare triple {21218#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {21218#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 87: Hoare triple {21218#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {21218#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {21218#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {21218#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21218#true} is VALID [2022-04-07 16:10:22,469 INFO L290 TraceCheckUtils]: 91: Hoare triple {21218#true} assume 4416 == #t~mem60;havoc #t~mem60; {21218#true} is VALID [2022-04-07 16:10:22,469 INFO L290 TraceCheckUtils]: 92: Hoare triple {21218#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {21218#true} is VALID [2022-04-07 16:10:22,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {21218#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {21218#true} is VALID [2022-04-07 16:10:22,469 INFO L290 TraceCheckUtils]: 94: Hoare triple {21218#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); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,470 INFO L290 TraceCheckUtils]: 96: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,471 INFO L290 TraceCheckUtils]: 98: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,471 INFO L290 TraceCheckUtils]: 99: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,471 INFO L290 TraceCheckUtils]: 100: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,472 INFO L290 TraceCheckUtils]: 101: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,472 INFO L290 TraceCheckUtils]: 102: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,472 INFO L290 TraceCheckUtils]: 103: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,472 INFO L290 TraceCheckUtils]: 104: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 105: Hoare triple {21223#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21224#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 106: Hoare triple {21224#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 107: Hoare triple {21219#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 108: Hoare triple {21219#false} assume !(0 == ~blastFlag~0); {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 109: Hoare triple {21219#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 110: Hoare triple {21219#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 111: Hoare triple {21219#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 112: Hoare triple {21219#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 113: Hoare triple {21219#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 114: Hoare triple {21219#false} ~skip~0 := 0; {21219#false} is VALID [2022-04-07 16:10:22,473 INFO L290 TraceCheckUtils]: 115: Hoare triple {21219#false} assume !false; {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 116: Hoare triple {21219#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {21219#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 118: Hoare triple {21219#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 119: Hoare triple {21219#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 120: Hoare triple {21219#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 121: Hoare triple {21219#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 122: Hoare triple {21219#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 123: Hoare triple {21219#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 124: Hoare triple {21219#false} assume 4384 == #t~mem56;havoc #t~mem56; {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 125: Hoare triple {21219#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 126: Hoare triple {21219#false} assume !(1 == ~blastFlag~0); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 127: Hoare triple {21219#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 128: Hoare triple {21219#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 129: Hoare triple {21219#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 130: Hoare triple {21219#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 131: Hoare triple {21219#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 132: Hoare triple {21219#false} ~skip~0 := 0; {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 133: Hoare triple {21219#false} assume !false; {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 134: Hoare triple {21219#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 135: Hoare triple {21219#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,474 INFO L290 TraceCheckUtils]: 136: Hoare triple {21219#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 137: Hoare triple {21219#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 138: Hoare triple {21219#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 139: Hoare triple {21219#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 140: Hoare triple {21219#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 141: Hoare triple {21219#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 142: Hoare triple {21219#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 143: Hoare triple {21219#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 144: Hoare triple {21219#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 145: Hoare triple {21219#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 146: Hoare triple {21219#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 147: Hoare triple {21219#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 148: Hoare triple {21219#false} assume 4432 == #t~mem62;havoc #t~mem62; {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 149: Hoare triple {21219#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 150: Hoare triple {21219#false} assume 5 == ~blastFlag~0; {21219#false} is VALID [2022-04-07 16:10:22,475 INFO L290 TraceCheckUtils]: 151: Hoare triple {21219#false} assume !false; {21219#false} is VALID [2022-04-07 16:10:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-07 16:10:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915904814] [2022-04-07 16:10:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915904814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15204504] [2022-04-07 16:10:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-07 16:10:22,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:22,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:22,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:22,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:22,542 INFO L87 Difference]: Start difference. First operand 679 states and 995 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,561 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-07 16:10:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:25,838 INFO L93 Difference]: Finished difference Result 1682 states and 2470 transitions. [2022-04-07 16:10:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-07 16:10:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:25,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-07 16:10:26,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:26,193 INFO L225 Difference]: With dead ends: 1682 [2022-04-07 16:10:26,193 INFO L226 Difference]: Without dead ends: 1132 [2022-04-07 16:10:26,194 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-07 16:10:26,194 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 113 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:26,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 508 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:10:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-04-07 16:10:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 759. [2022-04-07 16:10:26,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:26,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1132 states. Second operand has 759 states, 754 states have (on average 1.4681697612732096) internal successors, (1107), 754 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:26,208 INFO L74 IsIncluded]: Start isIncluded. First operand 1132 states. Second operand has 759 states, 754 states have (on average 1.4681697612732096) internal successors, (1107), 754 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:26,209 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand has 759 states, 754 states have (on average 1.4681697612732096) internal successors, (1107), 754 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:26,242 INFO L93 Difference]: Finished difference Result 1132 states and 1654 transitions. [2022-04-07 16:10:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1654 transitions. [2022-04-07 16:10:26,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:26,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:26,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 759 states, 754 states have (on average 1.4681697612732096) internal successors, (1107), 754 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1132 states. [2022-04-07 16:10:26,245 INFO L87 Difference]: Start difference. First operand has 759 states, 754 states have (on average 1.4681697612732096) internal successors, (1107), 754 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1132 states. [2022-04-07 16:10:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:26,279 INFO L93 Difference]: Finished difference Result 1132 states and 1654 transitions. [2022-04-07 16:10:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1654 transitions. [2022-04-07 16:10:26,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:26,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:26,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:26,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 754 states have (on average 1.4681697612732096) internal successors, (1107), 754 states have internal predecessors, (1107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1111 transitions. [2022-04-07 16:10:26,299 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1111 transitions. Word has length 152 [2022-04-07 16:10:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:26,299 INFO L478 AbstractCegarLoop]: Abstraction has 759 states and 1111 transitions. [2022-04-07 16:10:26,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1111 transitions. [2022-04-07 16:10:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-07 16:10:26,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:26,301 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:26,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 16:10:26,301 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1211981165, now seen corresponding path program 1 times [2022-04-07 16:10:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:26,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652981146] [2022-04-07 16:10:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:26,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {26300#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {26293#true} is VALID [2022-04-07 16:10:26,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {26293#true} assume true; {26293#true} is VALID [2022-04-07 16:10:26,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26293#true} {26293#true} #593#return; {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {26293#true} call ULTIMATE.init(); {26300#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:26,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {26300#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {26293#true} assume true; {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26293#true} {26293#true} #593#return; {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {26293#true} call #t~ret158 := main(); {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {26293#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; {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {26293#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {26293#true} is VALID [2022-04-07 16:10:26,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {26293#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {26293#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {26293#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {26293#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {26293#true} assume !false; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {26293#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {26293#true} assume 12292 == #t~mem49;havoc #t~mem49; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {26293#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {26293#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {26293#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {26293#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {26293#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {26293#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {26293#true} assume !(0 == ~tmp___4~0); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {26293#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {26293#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {26293#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {26293#true} ~skip~0 := 0; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {26293#true} assume !false; {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {26293#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {26293#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {26293#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {26293#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {26293#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {26293#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {26293#true} assume 4368 == #t~mem54;havoc #t~mem54; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {26293#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {26293#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {26293#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {26293#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {26293#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {26293#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {26293#true} ~skip~0 := 0; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {26293#true} assume !false; {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {26293#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {26293#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {26293#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {26293#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {26293#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {26293#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {26293#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {26293#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {26293#true} assume 4384 == #t~mem56;havoc #t~mem56; {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {26293#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {26293#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {26293#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {26293#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {26293#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {26293#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {26293#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {26293#true} ~skip~0 := 0; {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {26293#true} assume !false; {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {26293#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {26293#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {26293#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {26293#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {26293#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {26293#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {26293#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {26293#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {26293#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {26293#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {26293#true} assume 4400 == #t~mem58;havoc #t~mem58; {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {26293#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 71: Hoare triple {26293#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 72: Hoare triple {26293#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {26293#true} assume !(~ret~0 <= 0); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {26293#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 75: Hoare triple {26293#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 76: Hoare triple {26293#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 77: Hoare triple {26293#true} ~skip~0 := 0; {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 78: Hoare triple {26293#true} assume !false; {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 79: Hoare triple {26293#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 80: Hoare triple {26293#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {26293#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {26293#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {26293#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {26293#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {26293#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {26293#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,484 INFO L290 TraceCheckUtils]: 87: Hoare triple {26293#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,485 INFO L290 TraceCheckUtils]: 88: Hoare triple {26293#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,485 INFO L290 TraceCheckUtils]: 89: Hoare triple {26293#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {26293#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26293#true} is VALID [2022-04-07 16:10:26,485 INFO L290 TraceCheckUtils]: 91: Hoare triple {26293#true} assume 4416 == #t~mem60;havoc #t~mem60; {26293#true} is VALID [2022-04-07 16:10:26,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {26293#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {26293#true} is VALID [2022-04-07 16:10:26,485 INFO L290 TraceCheckUtils]: 93: Hoare triple {26293#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {26293#true} is VALID [2022-04-07 16:10:26,486 INFO L290 TraceCheckUtils]: 94: Hoare triple {26293#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); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,486 INFO L290 TraceCheckUtils]: 95: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,486 INFO L290 TraceCheckUtils]: 96: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,486 INFO L290 TraceCheckUtils]: 97: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,487 INFO L290 TraceCheckUtils]: 98: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,487 INFO L290 TraceCheckUtils]: 99: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,487 INFO L290 TraceCheckUtils]: 100: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,487 INFO L290 TraceCheckUtils]: 101: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,487 INFO L290 TraceCheckUtils]: 102: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,488 INFO L290 TraceCheckUtils]: 104: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:26,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {26298#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26299#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 107: Hoare triple {26299#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {26294#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 109: Hoare triple {26294#false} assume !(0 == ~blastFlag~0); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 110: Hoare triple {26294#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 111: Hoare triple {26294#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 112: Hoare triple {26294#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 113: Hoare triple {26294#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 114: Hoare triple {26294#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 115: Hoare triple {26294#false} ~skip~0 := 0; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 116: Hoare triple {26294#false} assume !false; {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 117: Hoare triple {26294#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 118: Hoare triple {26294#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 119: Hoare triple {26294#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 120: Hoare triple {26294#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 121: Hoare triple {26294#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,489 INFO L290 TraceCheckUtils]: 122: Hoare triple {26294#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 123: Hoare triple {26294#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 124: Hoare triple {26294#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 125: Hoare triple {26294#false} assume 4384 == #t~mem56;havoc #t~mem56; {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 126: Hoare triple {26294#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 127: Hoare triple {26294#false} assume !(1 == ~blastFlag~0); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 128: Hoare triple {26294#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 129: Hoare triple {26294#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 130: Hoare triple {26294#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 131: Hoare triple {26294#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 132: Hoare triple {26294#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 133: Hoare triple {26294#false} ~skip~0 := 0; {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 134: Hoare triple {26294#false} assume !false; {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 135: Hoare triple {26294#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 136: Hoare triple {26294#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 137: Hoare triple {26294#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 138: Hoare triple {26294#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 139: Hoare triple {26294#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 140: Hoare triple {26294#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 141: Hoare triple {26294#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,490 INFO L290 TraceCheckUtils]: 142: Hoare triple {26294#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 143: Hoare triple {26294#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 144: Hoare triple {26294#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 145: Hoare triple {26294#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 146: Hoare triple {26294#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 147: Hoare triple {26294#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 148: Hoare triple {26294#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 149: Hoare triple {26294#false} assume 4432 == #t~mem62;havoc #t~mem62; {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 150: Hoare triple {26294#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 151: Hoare triple {26294#false} assume 5 == ~blastFlag~0; {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L290 TraceCheckUtils]: 152: Hoare triple {26294#false} assume !false; {26294#false} is VALID [2022-04-07 16:10:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-07 16:10:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:26,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652981146] [2022-04-07 16:10:26,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652981146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:26,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:26,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844958880] [2022-04-07 16:10:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-07 16:10:26,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:26,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:26,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:26,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:26,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:26,558 INFO L87 Difference]: Start difference. First operand 759 states and 1111 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:28,580 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-07 16:10:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:29,876 INFO L93 Difference]: Finished difference Result 1724 states and 2528 transitions. [2022-04-07 16:10:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:29,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-07 16:10:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-07 16:10:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-07 16:10:29,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-07 16:10:30,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:30,201 INFO L225 Difference]: With dead ends: 1724 [2022-04-07 16:10:30,201 INFO L226 Difference]: Without dead ends: 1110 [2022-04-07 16:10:30,202 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-07 16:10:30,203 INFO L913 BasicCegarLoop]: 239 mSDtfsCounter, 97 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:30,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 567 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 536 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-04-07 16:10:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 827. [2022-04-07 16:10:30,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:30,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1110 states. Second operand has 827 states, 822 states have (on average 1.4683698296836982) internal successors, (1207), 822 states have internal predecessors, (1207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:30,226 INFO L74 IsIncluded]: Start isIncluded. First operand 1110 states. Second operand has 827 states, 822 states have (on average 1.4683698296836982) internal successors, (1207), 822 states have internal predecessors, (1207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:30,227 INFO L87 Difference]: Start difference. First operand 1110 states. Second operand has 827 states, 822 states have (on average 1.4683698296836982) internal successors, (1207), 822 states have internal predecessors, (1207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:30,258 INFO L93 Difference]: Finished difference Result 1110 states and 1625 transitions. [2022-04-07 16:10:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1625 transitions. [2022-04-07 16:10:30,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:30,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:30,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 822 states have (on average 1.4683698296836982) internal successors, (1207), 822 states have internal predecessors, (1207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1110 states. [2022-04-07 16:10:30,262 INFO L87 Difference]: Start difference. First operand has 827 states, 822 states have (on average 1.4683698296836982) internal successors, (1207), 822 states have internal predecessors, (1207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1110 states. [2022-04-07 16:10:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:30,294 INFO L93 Difference]: Finished difference Result 1110 states and 1625 transitions. [2022-04-07 16:10:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1625 transitions. [2022-04-07 16:10:30,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:30,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:30,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:30,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 822 states have (on average 1.4683698296836982) internal successors, (1207), 822 states have internal predecessors, (1207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1211 transitions. [2022-04-07 16:10:30,318 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1211 transitions. Word has length 153 [2022-04-07 16:10:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:30,319 INFO L478 AbstractCegarLoop]: Abstraction has 827 states and 1211 transitions. [2022-04-07 16:10:30,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1211 transitions. [2022-04-07 16:10:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-07 16:10:30,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:30,321 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:30,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 16:10:30,321 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash -22163576, now seen corresponding path program 2 times [2022-04-07 16:10:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:30,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12115069] [2022-04-07 16:10:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:30,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {31434#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {31427#true} is VALID [2022-04-07 16:10:30,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {31427#true} assume true; {31427#true} is VALID [2022-04-07 16:10:30,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31427#true} {31427#true} #593#return; {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {31427#true} call ULTIMATE.init(); {31434#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:30,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {31434#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {31427#true} assume true; {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31427#true} {31427#true} #593#return; {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {31427#true} call #t~ret158 := main(); {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {31427#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; {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L272 TraceCheckUtils]: 6: Hoare triple {31427#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {31427#true} is VALID [2022-04-07 16:10:30,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {31427#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {31427#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {31427#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {31427#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {31427#true} assume !false; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {31427#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {31427#true} assume 12292 == #t~mem49;havoc #t~mem49; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {31427#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {31427#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {31427#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {31427#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {31427#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {31427#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {31427#true} assume !(0 == ~tmp___4~0); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {31427#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {31427#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {31427#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {31427#true} ~skip~0 := 0; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {31427#true} assume !false; {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {31427#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {31427#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {31427#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {31427#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {31427#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {31427#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {31427#true} assume 4368 == #t~mem54;havoc #t~mem54; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {31427#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {31427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {31427#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {31427#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {31427#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {31427#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {31427#true} ~skip~0 := 0; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {31427#true} assume !false; {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {31427#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {31427#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {31427#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {31427#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {31427#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {31427#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {31427#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {31427#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {31427#true} assume 4384 == #t~mem56;havoc #t~mem56; {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {31427#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {31427#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {31427#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {31427#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {31427#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {31427#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {31427#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {31427#true} ~skip~0 := 0; {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {31427#true} assume !false; {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {31427#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {31427#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {31427#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {31427#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {31427#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {31427#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {31427#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {31427#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 67: Hoare triple {31427#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {31427#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {31427#true} assume 4400 == #t~mem58;havoc #t~mem58; {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {31427#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 71: Hoare triple {31427#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {31427#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {31427#true} assume !(~ret~0 <= 0); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {31427#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {31427#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {31427#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {31427#true} ~skip~0 := 0; {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 78: Hoare triple {31427#true} assume !false; {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 79: Hoare triple {31427#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 80: Hoare triple {31427#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 81: Hoare triple {31427#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {31427#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {31427#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 84: Hoare triple {31427#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 85: Hoare triple {31427#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 86: Hoare triple {31427#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 87: Hoare triple {31427#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,496 INFO L290 TraceCheckUtils]: 88: Hoare triple {31427#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {31427#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,497 INFO L290 TraceCheckUtils]: 90: Hoare triple {31427#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31427#true} is VALID [2022-04-07 16:10:30,497 INFO L290 TraceCheckUtils]: 91: Hoare triple {31427#true} assume 4416 == #t~mem60;havoc #t~mem60; {31427#true} is VALID [2022-04-07 16:10:30,497 INFO L290 TraceCheckUtils]: 92: Hoare triple {31427#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {31427#true} is VALID [2022-04-07 16:10:30,497 INFO L290 TraceCheckUtils]: 93: Hoare triple {31427#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {31427#true} is VALID [2022-04-07 16:10:30,498 INFO L290 TraceCheckUtils]: 94: Hoare triple {31427#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); {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:30,498 INFO L290 TraceCheckUtils]: 95: Hoare triple {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:30,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:30,498 INFO L290 TraceCheckUtils]: 97: Hoare triple {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:30,498 INFO L290 TraceCheckUtils]: 98: Hoare triple {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 99: Hoare triple {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {31432#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31433#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {31433#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {31428#false} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 102: Hoare triple {31428#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {31428#false} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 103: Hoare triple {31428#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 104: Hoare triple {31428#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31428#false} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {31428#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 106: Hoare triple {31428#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,499 INFO L290 TraceCheckUtils]: 107: Hoare triple {31428#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 108: Hoare triple {31428#false} assume !(0 == ~tmp___4~0); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 109: Hoare triple {31428#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {31428#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 111: Hoare triple {31428#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 112: Hoare triple {31428#false} ~skip~0 := 0; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 113: Hoare triple {31428#false} assume !false; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 114: Hoare triple {31428#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 115: Hoare triple {31428#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 116: Hoare triple {31428#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 117: Hoare triple {31428#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 118: Hoare triple {31428#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 119: Hoare triple {31428#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 120: Hoare triple {31428#false} assume 4368 == #t~mem54;havoc #t~mem54; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 121: Hoare triple {31428#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 122: Hoare triple {31428#false} assume !(0 == ~blastFlag~0); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 123: Hoare triple {31428#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 124: Hoare triple {31428#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 125: Hoare triple {31428#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 126: Hoare triple {31428#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 127: Hoare triple {31428#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31428#false} is VALID [2022-04-07 16:10:30,500 INFO L290 TraceCheckUtils]: 128: Hoare triple {31428#false} ~skip~0 := 0; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 129: Hoare triple {31428#false} assume !false; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 130: Hoare triple {31428#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 131: Hoare triple {31428#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 132: Hoare triple {31428#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 133: Hoare triple {31428#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 134: Hoare triple {31428#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 135: Hoare triple {31428#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 136: Hoare triple {31428#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 137: Hoare triple {31428#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 138: Hoare triple {31428#false} assume 4384 == #t~mem56;havoc #t~mem56; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 139: Hoare triple {31428#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 140: Hoare triple {31428#false} assume !(1 == ~blastFlag~0); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 141: Hoare triple {31428#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 142: Hoare triple {31428#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 143: Hoare triple {31428#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 144: Hoare triple {31428#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 145: Hoare triple {31428#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 146: Hoare triple {31428#false} ~skip~0 := 0; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 147: Hoare triple {31428#false} assume !false; {31428#false} is VALID [2022-04-07 16:10:30,501 INFO L290 TraceCheckUtils]: 148: Hoare triple {31428#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 149: Hoare triple {31428#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 150: Hoare triple {31428#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 151: Hoare triple {31428#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 152: Hoare triple {31428#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 153: Hoare triple {31428#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 154: Hoare triple {31428#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 155: Hoare triple {31428#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 156: Hoare triple {31428#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 157: Hoare triple {31428#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 158: Hoare triple {31428#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 159: Hoare triple {31428#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 160: Hoare triple {31428#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 161: Hoare triple {31428#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 162: Hoare triple {31428#false} assume 4432 == #t~mem62;havoc #t~mem62; {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 163: Hoare triple {31428#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 164: Hoare triple {31428#false} assume 5 == ~blastFlag~0; {31428#false} is VALID [2022-04-07 16:10:30,502 INFO L290 TraceCheckUtils]: 165: Hoare triple {31428#false} assume !false; {31428#false} is VALID [2022-04-07 16:10:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-07 16:10:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:30,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12115069] [2022-04-07 16:10:30,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12115069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:30,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533071792] [2022-04-07 16:10:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:30,504 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 166 [2022-04-07 16:10:30,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:30,504 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-07 16:10:30,571 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-07 16:10:30,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:30,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:30,572 INFO L87 Difference]: Start difference. First operand 827 states and 1211 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-07 16:10:32,591 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-07 16:10:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:33,533 INFO L93 Difference]: Finished difference Result 2011 states and 2950 transitions. [2022-04-07 16:10:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:33,534 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 166 [2022-04-07 16:10:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:33,534 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-07 16:10:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:10:33,536 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-07 16:10:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:10:33,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-07 16:10:33,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:33,865 INFO L225 Difference]: With dead ends: 2011 [2022-04-07 16:10:33,866 INFO L226 Difference]: Without dead ends: 1200 [2022-04-07 16:10:33,867 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-07 16:10:33,867 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:33,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-04-07 16:10:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 827. [2022-04-07 16:10:33,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:33,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1200 states. Second operand has 827 states, 822 states have (on average 1.451338199513382) internal successors, (1193), 822 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:33,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1200 states. Second operand has 827 states, 822 states have (on average 1.451338199513382) internal successors, (1193), 822 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:33,882 INFO L87 Difference]: Start difference. First operand 1200 states. Second operand has 827 states, 822 states have (on average 1.451338199513382) internal successors, (1193), 822 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:33,917 INFO L93 Difference]: Finished difference Result 1200 states and 1745 transitions. [2022-04-07 16:10:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1745 transitions. [2022-04-07 16:10:33,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:33,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:33,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 822 states have (on average 1.451338199513382) internal successors, (1193), 822 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1200 states. [2022-04-07 16:10:33,920 INFO L87 Difference]: Start difference. First operand has 827 states, 822 states have (on average 1.451338199513382) internal successors, (1193), 822 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1200 states. [2022-04-07 16:10:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:33,956 INFO L93 Difference]: Finished difference Result 1200 states and 1745 transitions. [2022-04-07 16:10:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1745 transitions. [2022-04-07 16:10:33,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:33,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:33,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:33,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 822 states have (on average 1.451338199513382) internal successors, (1193), 822 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1197 transitions. [2022-04-07 16:10:33,980 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1197 transitions. Word has length 166 [2022-04-07 16:10:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:33,980 INFO L478 AbstractCegarLoop]: Abstraction has 827 states and 1197 transitions. [2022-04-07 16:10:33,980 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-07 16:10:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1197 transitions. [2022-04-07 16:10:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-07 16:10:33,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:33,982 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:33,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 16:10:33,982 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1496700185, now seen corresponding path program 1 times [2022-04-07 16:10:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:33,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653566729] [2022-04-07 16:10:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:34,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {37070#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {37063#true} is VALID [2022-04-07 16:10:34,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {37063#true} assume true; {37063#true} is VALID [2022-04-07 16:10:34,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37063#true} {37063#true} #593#return; {37063#true} is VALID [2022-04-07 16:10:34,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {37063#true} call ULTIMATE.init(); {37070#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:34,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {37070#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {37063#true} is VALID [2022-04-07 16:10:34,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {37063#true} assume true; {37063#true} is VALID [2022-04-07 16:10:34,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37063#true} {37063#true} #593#return; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {37063#true} call #t~ret158 := main(); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {37063#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; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {37063#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {37063#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {37063#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {37063#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {37063#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {37063#true} assume !false; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {37063#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {37063#true} assume 12292 == #t~mem49;havoc #t~mem49; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {37063#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {37063#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {37063#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {37063#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {37063#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {37063#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {37063#true} assume !(0 == ~tmp___4~0); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {37063#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {37063#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {37063#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37063#true} is VALID [2022-04-07 16:10:34,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {37063#true} ~skip~0 := 0; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {37063#true} assume !false; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {37063#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {37063#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {37063#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {37063#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {37063#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {37063#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {37063#true} assume 4368 == #t~mem54;havoc #t~mem54; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {37063#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {37063#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {37063#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {37063#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {37063#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {37063#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {37063#true} ~skip~0 := 0; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {37063#true} assume !false; {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {37063#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {37063#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {37063#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {37063#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {37063#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {37063#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {37063#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {37063#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {37063#true} assume 4384 == #t~mem56;havoc #t~mem56; {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {37063#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {37063#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {37063#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {37063#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {37063#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {37063#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {37063#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {37063#true} ~skip~0 := 0; {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {37063#true} assume !false; {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {37063#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {37063#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {37063#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {37063#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {37063#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {37063#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {37063#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {37063#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {37063#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {37063#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {37063#true} assume 4400 == #t~mem58;havoc #t~mem58; {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {37063#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {37063#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {37063#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {37063#true} assume !(~ret~0 <= 0); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {37063#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {37063#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {37063#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {37063#true} ~skip~0 := 0; {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {37063#true} assume !false; {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {37063#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {37063#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {37063#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {37063#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {37063#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {37063#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {37063#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {37063#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {37063#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {37063#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,165 INFO L290 TraceCheckUtils]: 89: Hoare triple {37063#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,165 INFO L290 TraceCheckUtils]: 90: Hoare triple {37063#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37063#true} is VALID [2022-04-07 16:10:34,165 INFO L290 TraceCheckUtils]: 91: Hoare triple {37063#true} assume 4416 == #t~mem60;havoc #t~mem60; {37063#true} is VALID [2022-04-07 16:10:34,165 INFO L290 TraceCheckUtils]: 92: Hoare triple {37063#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37063#true} is VALID [2022-04-07 16:10:34,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {37063#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37063#true} is VALID [2022-04-07 16:10:34,166 INFO L290 TraceCheckUtils]: 94: Hoare triple {37063#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); {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,166 INFO L290 TraceCheckUtils]: 95: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,166 INFO L290 TraceCheckUtils]: 96: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,166 INFO L290 TraceCheckUtils]: 97: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,167 INFO L290 TraceCheckUtils]: 98: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,167 INFO L290 TraceCheckUtils]: 101: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 102: Hoare triple {37068#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37069#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 103: Hoare triple {37069#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 104: Hoare triple {37064#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 105: Hoare triple {37064#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 106: Hoare triple {37064#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 107: Hoare triple {37064#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 108: Hoare triple {37064#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 109: Hoare triple {37064#false} assume !(0 == ~tmp___4~0); {37064#false} is VALID [2022-04-07 16:10:34,168 INFO L290 TraceCheckUtils]: 110: Hoare triple {37064#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 111: Hoare triple {37064#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 112: Hoare triple {37064#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 113: Hoare triple {37064#false} ~skip~0 := 0; {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {37064#false} assume !false; {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 115: Hoare triple {37064#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 116: Hoare triple {37064#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 117: Hoare triple {37064#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 118: Hoare triple {37064#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 119: Hoare triple {37064#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 120: Hoare triple {37064#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 121: Hoare triple {37064#false} assume 4368 == #t~mem54;havoc #t~mem54; {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 122: Hoare triple {37064#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 123: Hoare triple {37064#false} assume !(0 == ~blastFlag~0); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 124: Hoare triple {37064#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 125: Hoare triple {37064#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,169 INFO L290 TraceCheckUtils]: 126: Hoare triple {37064#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 127: Hoare triple {37064#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 128: Hoare triple {37064#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 129: Hoare triple {37064#false} ~skip~0 := 0; {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 130: Hoare triple {37064#false} assume !false; {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 131: Hoare triple {37064#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 132: Hoare triple {37064#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 133: Hoare triple {37064#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 134: Hoare triple {37064#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 135: Hoare triple {37064#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 136: Hoare triple {37064#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 137: Hoare triple {37064#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 138: Hoare triple {37064#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 139: Hoare triple {37064#false} assume 4384 == #t~mem56;havoc #t~mem56; {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 140: Hoare triple {37064#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37064#false} is VALID [2022-04-07 16:10:34,170 INFO L290 TraceCheckUtils]: 141: Hoare triple {37064#false} assume !(1 == ~blastFlag~0); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 142: Hoare triple {37064#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 143: Hoare triple {37064#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 144: Hoare triple {37064#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 145: Hoare triple {37064#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 146: Hoare triple {37064#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 147: Hoare triple {37064#false} ~skip~0 := 0; {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 148: Hoare triple {37064#false} assume !false; {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 149: Hoare triple {37064#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 150: Hoare triple {37064#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 151: Hoare triple {37064#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 152: Hoare triple {37064#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 153: Hoare triple {37064#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 154: Hoare triple {37064#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 155: Hoare triple {37064#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 156: Hoare triple {37064#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 157: Hoare triple {37064#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 158: Hoare triple {37064#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 159: Hoare triple {37064#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 160: Hoare triple {37064#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 161: Hoare triple {37064#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,171 INFO L290 TraceCheckUtils]: 162: Hoare triple {37064#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37064#false} is VALID [2022-04-07 16:10:34,172 INFO L290 TraceCheckUtils]: 163: Hoare triple {37064#false} assume 4432 == #t~mem62;havoc #t~mem62; {37064#false} is VALID [2022-04-07 16:10:34,172 INFO L290 TraceCheckUtils]: 164: Hoare triple {37064#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37064#false} is VALID [2022-04-07 16:10:34,172 INFO L290 TraceCheckUtils]: 165: Hoare triple {37064#false} assume 5 == ~blastFlag~0; {37064#false} is VALID [2022-04-07 16:10:34,172 INFO L290 TraceCheckUtils]: 166: Hoare triple {37064#false} assume !false; {37064#false} is VALID [2022-04-07 16:10:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-07 16:10:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653566729] [2022-04-07 16:10:34,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653566729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:34,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:34,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901450856] [2022-04-07 16:10:34,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:34,175 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 167 [2022-04-07 16:10:34,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:34,175 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-07 16:10:34,244 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-07 16:10:34,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:34,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:34,245 INFO L87 Difference]: Start difference. First operand 827 states and 1197 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-07 16:10:36,265 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-07 16:10:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:37,549 INFO L93 Difference]: Finished difference Result 1917 states and 2784 transitions. [2022-04-07 16:10:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:37,549 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 167 [2022-04-07 16:10:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:37,549 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-07 16:10:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-07 16:10:37,552 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-07 16:10:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-07 16:10:37,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-07 16:10:37,855 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-07 16:10:37,895 INFO L225 Difference]: With dead ends: 1917 [2022-04-07 16:10:37,895 INFO L226 Difference]: Without dead ends: 1106 [2022-04-07 16:10:37,896 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-07 16:10:37,897 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 99 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:37,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 563 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 530 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-04-07 16:10:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 827. [2022-04-07 16:10:37,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:37,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1106 states. Second operand has 827 states, 822 states have (on average 1.4464720194647203) internal successors, (1189), 822 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:37,910 INFO L74 IsIncluded]: Start isIncluded. First operand 1106 states. Second operand has 827 states, 822 states have (on average 1.4464720194647203) internal successors, (1189), 822 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:37,910 INFO L87 Difference]: Start difference. First operand 1106 states. Second operand has 827 states, 822 states have (on average 1.4464720194647203) internal successors, (1189), 822 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:37,941 INFO L93 Difference]: Finished difference Result 1106 states and 1603 transitions. [2022-04-07 16:10:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1603 transitions. [2022-04-07 16:10:37,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:37,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:37,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 822 states have (on average 1.4464720194647203) internal successors, (1189), 822 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1106 states. [2022-04-07 16:10:37,943 INFO L87 Difference]: Start difference. First operand has 827 states, 822 states have (on average 1.4464720194647203) internal successors, (1189), 822 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1106 states. [2022-04-07 16:10:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:37,973 INFO L93 Difference]: Finished difference Result 1106 states and 1603 transitions. [2022-04-07 16:10:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1603 transitions. [2022-04-07 16:10:37,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:37,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:37,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:37,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 822 states have (on average 1.4464720194647203) internal successors, (1189), 822 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1193 transitions. [2022-04-07 16:10:37,995 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1193 transitions. Word has length 167 [2022-04-07 16:10:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:37,996 INFO L478 AbstractCegarLoop]: Abstraction has 827 states and 1193 transitions. [2022-04-07 16:10:37,996 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-07 16:10:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1193 transitions. [2022-04-07 16:10:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-07 16:10:37,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:37,997 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:37,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 16:10:37,997 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:37,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1030373157, now seen corresponding path program 1 times [2022-04-07 16:10:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:37,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13834587] [2022-04-07 16:10:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:38,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {42406#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {42399#true} is VALID [2022-04-07 16:10:38,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {42399#true} assume true; {42399#true} is VALID [2022-04-07 16:10:38,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42399#true} {42399#true} #593#return; {42399#true} is VALID [2022-04-07 16:10:38,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {42399#true} call ULTIMATE.init(); {42406#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:38,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {42406#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {42399#true} is VALID [2022-04-07 16:10:38,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {42399#true} assume true; {42399#true} is VALID [2022-04-07 16:10:38,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42399#true} {42399#true} #593#return; {42399#true} is VALID [2022-04-07 16:10:38,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {42399#true} call #t~ret158 := main(); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {42399#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; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {42399#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {42399#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {42399#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {42399#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {42399#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {42399#true} assume !false; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {42399#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {42399#true} assume 12292 == #t~mem49;havoc #t~mem49; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {42399#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {42399#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {42399#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {42399#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {42399#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {42399#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {42399#true} assume !(0 == ~tmp___4~0); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {42399#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {42399#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {42399#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42399#true} is VALID [2022-04-07 16:10:38,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {42399#true} ~skip~0 := 0; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {42399#true} assume !false; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {42399#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {42399#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {42399#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {42399#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {42399#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {42399#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {42399#true} assume 4368 == #t~mem54;havoc #t~mem54; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {42399#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {42399#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {42399#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {42399#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {42399#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {42399#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {42399#true} ~skip~0 := 0; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {42399#true} assume !false; {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {42399#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {42399#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {42399#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {42399#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {42399#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {42399#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {42399#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {42399#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {42399#true} assume 4384 == #t~mem56;havoc #t~mem56; {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {42399#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {42399#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {42399#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {42399#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {42399#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 55: Hoare triple {42399#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {42399#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {42399#true} ~skip~0 := 0; {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {42399#true} assume !false; {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {42399#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {42399#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {42399#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {42399#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {42399#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {42399#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {42399#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {42399#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {42399#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {42399#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {42399#true} assume 4400 == #t~mem58;havoc #t~mem58; {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {42399#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {42399#true} assume !(~ret~0 <= 0); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {42399#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {42399#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {42399#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 77: Hoare triple {42399#true} ~skip~0 := 0; {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 78: Hoare triple {42399#true} assume !false; {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 79: Hoare triple {42399#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 80: Hoare triple {42399#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 81: Hoare triple {42399#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 82: Hoare triple {42399#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 83: Hoare triple {42399#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 84: Hoare triple {42399#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 85: Hoare triple {42399#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 86: Hoare triple {42399#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 87: Hoare triple {42399#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,170 INFO L290 TraceCheckUtils]: 88: Hoare triple {42399#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,171 INFO L290 TraceCheckUtils]: 89: Hoare triple {42399#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,171 INFO L290 TraceCheckUtils]: 90: Hoare triple {42399#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42399#true} is VALID [2022-04-07 16:10:38,171 INFO L290 TraceCheckUtils]: 91: Hoare triple {42399#true} assume 4416 == #t~mem60;havoc #t~mem60; {42399#true} is VALID [2022-04-07 16:10:38,171 INFO L290 TraceCheckUtils]: 92: Hoare triple {42399#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {42399#true} is VALID [2022-04-07 16:10:38,171 INFO L290 TraceCheckUtils]: 93: Hoare triple {42399#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {42399#true} is VALID [2022-04-07 16:10:38,172 INFO L290 TraceCheckUtils]: 94: Hoare triple {42399#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); {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,172 INFO L290 TraceCheckUtils]: 95: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,172 INFO L290 TraceCheckUtils]: 96: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,172 INFO L290 TraceCheckUtils]: 97: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,173 INFO L290 TraceCheckUtils]: 98: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,173 INFO L290 TraceCheckUtils]: 99: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,173 INFO L290 TraceCheckUtils]: 100: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,173 INFO L290 TraceCheckUtils]: 101: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,173 INFO L290 TraceCheckUtils]: 102: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 103: Hoare triple {42404#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42405#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 104: Hoare triple {42405#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 105: Hoare triple {42400#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 106: Hoare triple {42400#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 107: Hoare triple {42400#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 108: Hoare triple {42400#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 109: Hoare triple {42400#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 110: Hoare triple {42400#false} assume !(0 == ~tmp___4~0); {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 111: Hoare triple {42400#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,174 INFO L290 TraceCheckUtils]: 112: Hoare triple {42400#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 113: Hoare triple {42400#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 114: Hoare triple {42400#false} ~skip~0 := 0; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 115: Hoare triple {42400#false} assume !false; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 116: Hoare triple {42400#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 117: Hoare triple {42400#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 118: Hoare triple {42400#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 119: Hoare triple {42400#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {42400#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 121: Hoare triple {42400#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 122: Hoare triple {42400#false} assume 4368 == #t~mem54;havoc #t~mem54; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 123: Hoare triple {42400#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 124: Hoare triple {42400#false} assume !(0 == ~blastFlag~0); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 125: Hoare triple {42400#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 126: Hoare triple {42400#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 127: Hoare triple {42400#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 128: Hoare triple {42400#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 129: Hoare triple {42400#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 130: Hoare triple {42400#false} ~skip~0 := 0; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 131: Hoare triple {42400#false} assume !false; {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 132: Hoare triple {42400#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 133: Hoare triple {42400#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,175 INFO L290 TraceCheckUtils]: 134: Hoare triple {42400#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 135: Hoare triple {42400#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 136: Hoare triple {42400#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 137: Hoare triple {42400#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 138: Hoare triple {42400#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 139: Hoare triple {42400#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 140: Hoare triple {42400#false} assume 4384 == #t~mem56;havoc #t~mem56; {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 141: Hoare triple {42400#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 142: Hoare triple {42400#false} assume !(1 == ~blastFlag~0); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 143: Hoare triple {42400#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 144: Hoare triple {42400#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 145: Hoare triple {42400#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 146: Hoare triple {42400#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 147: Hoare triple {42400#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 148: Hoare triple {42400#false} ~skip~0 := 0; {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 149: Hoare triple {42400#false} assume !false; {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 150: Hoare triple {42400#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 151: Hoare triple {42400#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 152: Hoare triple {42400#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 153: Hoare triple {42400#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 154: Hoare triple {42400#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,176 INFO L290 TraceCheckUtils]: 155: Hoare triple {42400#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 156: Hoare triple {42400#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 157: Hoare triple {42400#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 158: Hoare triple {42400#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 159: Hoare triple {42400#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 160: Hoare triple {42400#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 161: Hoare triple {42400#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 162: Hoare triple {42400#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 163: Hoare triple {42400#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 164: Hoare triple {42400#false} assume 4432 == #t~mem62;havoc #t~mem62; {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 165: Hoare triple {42400#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 166: Hoare triple {42400#false} assume 5 == ~blastFlag~0; {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L290 TraceCheckUtils]: 167: Hoare triple {42400#false} assume !false; {42400#false} is VALID [2022-04-07 16:10:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-07 16:10:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:38,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13834587] [2022-04-07 16:10:38,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13834587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:38,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:38,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663431749] [2022-04-07 16:10:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:38,178 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 168 [2022-04-07 16:10:38,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:38,179 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-07 16:10:38,252 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-07 16:10:38,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:38,253 INFO L87 Difference]: Start difference. First operand 827 states and 1193 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-07 16:10:40,275 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-07 16:10:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:41,498 INFO L93 Difference]: Finished difference Result 1881 states and 2732 transitions. [2022-04-07 16:10:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:41,498 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 168 [2022-04-07 16:10:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:41,498 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-07 16:10:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-07 16:10:41,500 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-07 16:10:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-07 16:10:41,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-07 16:10:41,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:41,806 INFO L225 Difference]: With dead ends: 1881 [2022-04-07 16:10:41,806 INFO L226 Difference]: Without dead ends: 1070 [2022-04-07 16:10:41,807 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-07 16:10:41,808 INFO L913 BasicCegarLoop]: 230 mSDtfsCounter, 90 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:41,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 549 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-04-07 16:10:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 827. [2022-04-07 16:10:41,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:41,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1070 states. Second operand has 827 states, 822 states have (on average 1.4416058394160585) internal successors, (1185), 822 states have internal predecessors, (1185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:41,822 INFO L74 IsIncluded]: Start isIncluded. First operand 1070 states. Second operand has 827 states, 822 states have (on average 1.4416058394160585) internal successors, (1185), 822 states have internal predecessors, (1185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:41,822 INFO L87 Difference]: Start difference. First operand 1070 states. Second operand has 827 states, 822 states have (on average 1.4416058394160585) internal successors, (1185), 822 states have internal predecessors, (1185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:41,852 INFO L93 Difference]: Finished difference Result 1070 states and 1555 transitions. [2022-04-07 16:10:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1555 transitions. [2022-04-07 16:10:41,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:41,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:41,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 822 states have (on average 1.4416058394160585) internal successors, (1185), 822 states have internal predecessors, (1185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1070 states. [2022-04-07 16:10:41,854 INFO L87 Difference]: Start difference. First operand has 827 states, 822 states have (on average 1.4416058394160585) internal successors, (1185), 822 states have internal predecessors, (1185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1070 states. [2022-04-07 16:10:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:41,886 INFO L93 Difference]: Finished difference Result 1070 states and 1555 transitions. [2022-04-07 16:10:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1555 transitions. [2022-04-07 16:10:41,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:41,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:41,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:41,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 822 states have (on average 1.4416058394160585) internal successors, (1185), 822 states have internal predecessors, (1185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1189 transitions. [2022-04-07 16:10:41,909 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1189 transitions. Word has length 168 [2022-04-07 16:10:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:41,909 INFO L478 AbstractCegarLoop]: Abstraction has 827 states and 1189 transitions. [2022-04-07 16:10:41,909 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-07 16:10:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1189 transitions. [2022-04-07 16:10:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-07 16:10:41,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:41,910 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:41,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 16:10:41,911 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash -310692014, now seen corresponding path program 2 times [2022-04-07 16:10:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:41,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460356224] [2022-04-07 16:10:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:42,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {47630#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {47623#true} is VALID [2022-04-07 16:10:42,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {47623#true} assume true; {47623#true} is VALID [2022-04-07 16:10:42,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47623#true} {47623#true} #593#return; {47623#true} is VALID [2022-04-07 16:10:42,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {47623#true} call ULTIMATE.init(); {47630#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:42,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {47630#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {47623#true} is VALID [2022-04-07 16:10:42,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {47623#true} assume true; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47623#true} {47623#true} #593#return; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {47623#true} call #t~ret158 := main(); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {47623#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; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {47623#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {47623#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {47623#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {47623#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {47623#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {47623#true} assume !false; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {47623#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {47623#true} assume 12292 == #t~mem49;havoc #t~mem49; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {47623#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {47623#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {47623#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {47623#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {47623#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {47623#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {47623#true} assume !(0 == ~tmp___4~0); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {47623#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {47623#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {47623#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {47623#true} ~skip~0 := 0; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {47623#true} assume !false; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {47623#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {47623#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {47623#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {47623#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {47623#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {47623#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {47623#true} assume 4368 == #t~mem54;havoc #t~mem54; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {47623#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {47623#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {47623#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {47623#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {47623#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {47623#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {47623#true} ~skip~0 := 0; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {47623#true} assume !false; {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {47623#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {47623#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {47623#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {47623#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {47623#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {47623#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {47623#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {47623#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {47623#true} assume 4384 == #t~mem56;havoc #t~mem56; {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {47623#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 51: Hoare triple {47623#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {47623#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {47623#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {47623#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {47623#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {47623#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {47623#true} ~skip~0 := 0; {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {47623#true} assume !false; {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {47623#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {47623#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {47623#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {47623#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {47623#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {47623#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {47623#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {47623#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {47623#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {47623#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 69: Hoare triple {47623#true} assume 4400 == #t~mem58;havoc #t~mem58; {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 70: Hoare triple {47623#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 71: Hoare triple {47623#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 72: Hoare triple {47623#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 73: Hoare triple {47623#true} assume !(~ret~0 <= 0); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 74: Hoare triple {47623#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 75: Hoare triple {47623#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 76: Hoare triple {47623#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {47623#true} ~skip~0 := 0; {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 78: Hoare triple {47623#true} assume !false; {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 79: Hoare triple {47623#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 80: Hoare triple {47623#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 81: Hoare triple {47623#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 82: Hoare triple {47623#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 83: Hoare triple {47623#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 84: Hoare triple {47623#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 85: Hoare triple {47623#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,086 INFO L290 TraceCheckUtils]: 86: Hoare triple {47623#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 87: Hoare triple {47623#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {47623#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {47623#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {47623#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 91: Hoare triple {47623#true} assume 4416 == #t~mem60;havoc #t~mem60; {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {47623#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {47623#true} is VALID [2022-04-07 16:10:42,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {47623#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {47623#true} is VALID [2022-04-07 16:10:42,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {47623#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); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,088 INFO L290 TraceCheckUtils]: 95: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,088 INFO L290 TraceCheckUtils]: 97: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,089 INFO L290 TraceCheckUtils]: 98: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,089 INFO L290 TraceCheckUtils]: 99: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,089 INFO L290 TraceCheckUtils]: 100: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,089 INFO L290 TraceCheckUtils]: 101: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,089 INFO L290 TraceCheckUtils]: 102: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,090 INFO L290 TraceCheckUtils]: 103: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,090 INFO L290 TraceCheckUtils]: 104: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,090 INFO L290 TraceCheckUtils]: 105: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,090 INFO L290 TraceCheckUtils]: 106: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 107: Hoare triple {47628#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47629#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 108: Hoare triple {47629#(= |ssl3_connect_#t~mem56| 4432)} assume 4384 == #t~mem56;havoc #t~mem56; {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 109: Hoare triple {47624#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 110: Hoare triple {47624#false} assume !(1 == ~blastFlag~0); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 111: Hoare triple {47624#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 112: Hoare triple {47624#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 113: Hoare triple {47624#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 114: Hoare triple {47624#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 115: Hoare triple {47624#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 116: Hoare triple {47624#false} ~skip~0 := 0; {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 117: Hoare triple {47624#false} assume !false; {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 118: Hoare triple {47624#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 119: Hoare triple {47624#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 120: Hoare triple {47624#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 121: Hoare triple {47624#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,091 INFO L290 TraceCheckUtils]: 122: Hoare triple {47624#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 123: Hoare triple {47624#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 124: Hoare triple {47624#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 125: Hoare triple {47624#false} assume 4369 == #t~mem55;havoc #t~mem55; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 126: Hoare triple {47624#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 127: Hoare triple {47624#false} assume !(0 == ~blastFlag~0); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 128: Hoare triple {47624#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 129: Hoare triple {47624#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 130: Hoare triple {47624#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 131: Hoare triple {47624#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 132: Hoare triple {47624#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 133: Hoare triple {47624#false} ~skip~0 := 0; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 134: Hoare triple {47624#false} assume !false; {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 135: Hoare triple {47624#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 136: Hoare triple {47624#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 137: Hoare triple {47624#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 138: Hoare triple {47624#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 139: Hoare triple {47624#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 140: Hoare triple {47624#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 141: Hoare triple {47624#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 142: Hoare triple {47624#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,092 INFO L290 TraceCheckUtils]: 143: Hoare triple {47624#false} assume 4384 == #t~mem56;havoc #t~mem56; {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 144: Hoare triple {47624#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 145: Hoare triple {47624#false} assume !(1 == ~blastFlag~0); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 146: Hoare triple {47624#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 147: Hoare triple {47624#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 148: Hoare triple {47624#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 149: Hoare triple {47624#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 150: Hoare triple {47624#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 151: Hoare triple {47624#false} ~skip~0 := 0; {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 152: Hoare triple {47624#false} assume !false; {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 153: Hoare triple {47624#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 154: Hoare triple {47624#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 155: Hoare triple {47624#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 156: Hoare triple {47624#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 157: Hoare triple {47624#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 158: Hoare triple {47624#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 159: Hoare triple {47624#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 160: Hoare triple {47624#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 161: Hoare triple {47624#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 162: Hoare triple {47624#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 163: Hoare triple {47624#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 164: Hoare triple {47624#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,093 INFO L290 TraceCheckUtils]: 165: Hoare triple {47624#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,094 INFO L290 TraceCheckUtils]: 166: Hoare triple {47624#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47624#false} is VALID [2022-04-07 16:10:42,094 INFO L290 TraceCheckUtils]: 167: Hoare triple {47624#false} assume 4432 == #t~mem62;havoc #t~mem62; {47624#false} is VALID [2022-04-07 16:10:42,094 INFO L290 TraceCheckUtils]: 168: Hoare triple {47624#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {47624#false} is VALID [2022-04-07 16:10:42,094 INFO L290 TraceCheckUtils]: 169: Hoare triple {47624#false} assume 5 == ~blastFlag~0; {47624#false} is VALID [2022-04-07 16:10:42,094 INFO L290 TraceCheckUtils]: 170: Hoare triple {47624#false} assume !false; {47624#false} is VALID [2022-04-07 16:10:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-07 16:10:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:42,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460356224] [2022-04-07 16:10:42,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460356224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:42,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:42,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169709615] [2022-04-07 16:10:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:42,095 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 171 [2022-04-07 16:10:42,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:42,095 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-07 16:10:42,165 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-07 16:10:42,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:42,166 INFO L87 Difference]: Start difference. First operand 827 states and 1189 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-07 16:10:44,186 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-07 16:10:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:45,405 INFO L93 Difference]: Finished difference Result 1881 states and 2724 transitions. [2022-04-07 16:10:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:45,405 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 171 [2022-04-07 16:10:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:45,405 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-07 16:10:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-07 16:10:45,407 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-07 16:10:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-07 16:10:45,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-07 16:10:45,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:45,715 INFO L225 Difference]: With dead ends: 1881 [2022-04-07 16:10:45,715 INFO L226 Difference]: Without dead ends: 1070 [2022-04-07 16:10:45,716 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-07 16:10:45,716 INFO L913 BasicCegarLoop]: 229 mSDtfsCounter, 85 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:45,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 547 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 506 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-04-07 16:10:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 831. [2022-04-07 16:10:45,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:45,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1070 states. Second operand has 831 states, 826 states have (on average 1.4394673123486683) internal successors, (1189), 826 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,731 INFO L74 IsIncluded]: Start isIncluded. First operand 1070 states. Second operand has 831 states, 826 states have (on average 1.4394673123486683) internal successors, (1189), 826 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,731 INFO L87 Difference]: Start difference. First operand 1070 states. Second operand has 831 states, 826 states have (on average 1.4394673123486683) internal successors, (1189), 826 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:45,762 INFO L93 Difference]: Finished difference Result 1070 states and 1551 transitions. [2022-04-07 16:10:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1551 transitions. [2022-04-07 16:10:45,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:45,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:45,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 831 states, 826 states have (on average 1.4394673123486683) internal successors, (1189), 826 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1070 states. [2022-04-07 16:10:45,765 INFO L87 Difference]: Start difference. First operand has 831 states, 826 states have (on average 1.4394673123486683) internal successors, (1189), 826 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1070 states. [2022-04-07 16:10:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:45,795 INFO L93 Difference]: Finished difference Result 1070 states and 1551 transitions. [2022-04-07 16:10:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1551 transitions. [2022-04-07 16:10:45,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:45,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:45,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:45,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 826 states have (on average 1.4394673123486683) internal successors, (1189), 826 states have internal predecessors, (1189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1193 transitions. [2022-04-07 16:10:45,818 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1193 transitions. Word has length 171 [2022-04-07 16:10:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:45,818 INFO L478 AbstractCegarLoop]: Abstraction has 831 states and 1193 transitions. [2022-04-07 16:10:45,818 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-07 16:10:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1193 transitions. [2022-04-07 16:10:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-07 16:10:45,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:45,819 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:45,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 16:10:45,820 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash -228612804, now seen corresponding path program 1 times [2022-04-07 16:10:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:45,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384951045] [2022-04-07 16:10:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:45,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {52858#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {52851#true} is VALID [2022-04-07 16:10:45,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {52851#true} assume true; {52851#true} is VALID [2022-04-07 16:10:45,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52851#true} {52851#true} #593#return; {52851#true} is VALID [2022-04-07 16:10:45,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {52851#true} call ULTIMATE.init(); {52858#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:45,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {52858#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {52851#true} is VALID [2022-04-07 16:10:45,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {52851#true} assume true; {52851#true} is VALID [2022-04-07 16:10:45,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52851#true} {52851#true} #593#return; {52851#true} is VALID [2022-04-07 16:10:45,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {52851#true} call #t~ret158 := main(); {52851#true} is VALID [2022-04-07 16:10:45,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {52851#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; {52851#true} is VALID [2022-04-07 16:10:45,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {52851#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {52851#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {52851#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {52851#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {52851#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {52851#true} assume !false; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {52851#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {52851#true} assume 12292 == #t~mem49;havoc #t~mem49; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {52851#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {52851#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {52851#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {52851#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {52851#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {52851#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {52851#true} assume !(0 == ~tmp___4~0); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {52851#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {52851#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {52851#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {52851#true} ~skip~0 := 0; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {52851#true} assume !false; {52851#true} is VALID [2022-04-07 16:10:45,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {52851#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {52851#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {52851#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {52851#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {52851#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {52851#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {52851#true} assume 4368 == #t~mem54;havoc #t~mem54; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {52851#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {52851#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {52851#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {52851#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {52851#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {52851#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {52851#true} ~skip~0 := 0; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {52851#true} assume !false; {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {52851#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {52851#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {52851#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {52851#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {52851#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {52851#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {52851#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {52851#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {52851#true} assume 4384 == #t~mem56;havoc #t~mem56; {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {52851#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {52851#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {52851#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {52851#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {52851#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {52851#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {52851#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {52851#true} ~skip~0 := 0; {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {52851#true} assume !false; {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {52851#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {52851#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {52851#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {52851#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {52851#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {52851#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {52851#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {52851#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {52851#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {52851#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {52851#true} assume 4400 == #t~mem58;havoc #t~mem58; {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {52851#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {52851#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {52851#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {52851#true} assume !(~ret~0 <= 0); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {52851#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {52851#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {52851#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {52851#true} ~skip~0 := 0; {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {52851#true} assume !false; {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 79: Hoare triple {52851#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 80: Hoare triple {52851#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 81: Hoare triple {52851#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 82: Hoare triple {52851#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {52851#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {52851#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {52851#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {52851#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {52851#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 88: Hoare triple {52851#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 89: Hoare triple {52851#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,996 INFO L290 TraceCheckUtils]: 90: Hoare triple {52851#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52851#true} is VALID [2022-04-07 16:10:45,997 INFO L290 TraceCheckUtils]: 91: Hoare triple {52851#true} assume 4416 == #t~mem60;havoc #t~mem60; {52851#true} is VALID [2022-04-07 16:10:45,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {52851#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {52851#true} is VALID [2022-04-07 16:10:45,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {52851#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52851#true} is VALID [2022-04-07 16:10:45,998 INFO L290 TraceCheckUtils]: 94: Hoare triple {52851#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); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,998 INFO L290 TraceCheckUtils]: 95: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,998 INFO L290 TraceCheckUtils]: 97: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,999 INFO L290 TraceCheckUtils]: 98: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,999 INFO L290 TraceCheckUtils]: 99: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,999 INFO L290 TraceCheckUtils]: 100: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,999 INFO L290 TraceCheckUtils]: 101: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:45,999 INFO L290 TraceCheckUtils]: 102: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,000 INFO L290 TraceCheckUtils]: 103: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,000 INFO L290 TraceCheckUtils]: 104: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,000 INFO L290 TraceCheckUtils]: 105: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,000 INFO L290 TraceCheckUtils]: 106: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,000 INFO L290 TraceCheckUtils]: 107: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 108: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 109: Hoare triple {52856#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52857#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 110: Hoare triple {52857#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {52852#false} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 111: Hoare triple {52852#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 112: Hoare triple {52852#false} assume 0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296;havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;~skip~0 := 1; {52852#false} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 113: Hoare triple {52852#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,001 INFO L290 TraceCheckUtils]: 114: Hoare triple {52852#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 115: Hoare triple {52852#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 116: Hoare triple {52852#false} ~skip~0 := 0; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 117: Hoare triple {52852#false} assume !false; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 118: Hoare triple {52852#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 119: Hoare triple {52852#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 120: Hoare triple {52852#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 121: Hoare triple {52852#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 122: Hoare triple {52852#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 123: Hoare triple {52852#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {52852#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {52852#false} assume 4369 == #t~mem55;havoc #t~mem55; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {52852#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {52852#false} assume !(0 == ~blastFlag~0); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 128: Hoare triple {52852#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 129: Hoare triple {52852#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 130: Hoare triple {52852#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 131: Hoare triple {52852#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 132: Hoare triple {52852#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 133: Hoare triple {52852#false} ~skip~0 := 0; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 134: Hoare triple {52852#false} assume !false; {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 135: Hoare triple {52852#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,002 INFO L290 TraceCheckUtils]: 136: Hoare triple {52852#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 137: Hoare triple {52852#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 138: Hoare triple {52852#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 139: Hoare triple {52852#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 140: Hoare triple {52852#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 141: Hoare triple {52852#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 142: Hoare triple {52852#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 143: Hoare triple {52852#false} assume 4384 == #t~mem56;havoc #t~mem56; {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 144: Hoare triple {52852#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 145: Hoare triple {52852#false} assume !(1 == ~blastFlag~0); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 146: Hoare triple {52852#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 147: Hoare triple {52852#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 148: Hoare triple {52852#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 149: Hoare triple {52852#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 150: Hoare triple {52852#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 151: Hoare triple {52852#false} ~skip~0 := 0; {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 152: Hoare triple {52852#false} assume !false; {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 153: Hoare triple {52852#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 154: Hoare triple {52852#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 155: Hoare triple {52852#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,003 INFO L290 TraceCheckUtils]: 156: Hoare triple {52852#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 157: Hoare triple {52852#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 158: Hoare triple {52852#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 159: Hoare triple {52852#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 160: Hoare triple {52852#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 161: Hoare triple {52852#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 162: Hoare triple {52852#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 163: Hoare triple {52852#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 164: Hoare triple {52852#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 165: Hoare triple {52852#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 166: Hoare triple {52852#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 167: Hoare triple {52852#false} assume 4432 == #t~mem62;havoc #t~mem62; {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 168: Hoare triple {52852#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 169: Hoare triple {52852#false} assume 5 == ~blastFlag~0; {52852#false} is VALID [2022-04-07 16:10:46,004 INFO L290 TraceCheckUtils]: 170: Hoare triple {52852#false} assume !false; {52852#false} is VALID [2022-04-07 16:10:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-07 16:10:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:46,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384951045] [2022-04-07 16:10:46,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384951045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:46,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:46,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391840738] [2022-04-07 16:10:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:46,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-07 16:10:46,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:46,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:46,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:46,074 INFO L87 Difference]: Start difference. First operand 831 states and 1193 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:48,094 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-07 16:10:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:49,071 INFO L93 Difference]: Finished difference Result 2105 states and 3035 transitions. [2022-04-07 16:10:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-07 16:10:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:49,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:10:49,371 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-07 16:10:49,422 INFO L225 Difference]: With dead ends: 2105 [2022-04-07 16:10:49,423 INFO L226 Difference]: Without dead ends: 1290 [2022-04-07 16:10:49,423 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-07 16:10:49,424 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:49,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 288 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-04-07 16:10:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 941. [2022-04-07 16:10:49,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:49,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1290 states. Second operand has 941 states, 936 states have (on average 1.4465811965811965) internal successors, (1354), 936 states have internal predecessors, (1354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,440 INFO L74 IsIncluded]: Start isIncluded. First operand 1290 states. Second operand has 941 states, 936 states have (on average 1.4465811965811965) internal successors, (1354), 936 states have internal predecessors, (1354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,441 INFO L87 Difference]: Start difference. First operand 1290 states. Second operand has 941 states, 936 states have (on average 1.4465811965811965) internal successors, (1354), 936 states have internal predecessors, (1354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:49,481 INFO L93 Difference]: Finished difference Result 1290 states and 1857 transitions. [2022-04-07 16:10:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1857 transitions. [2022-04-07 16:10:49,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:49,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:49,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 941 states, 936 states have (on average 1.4465811965811965) internal successors, (1354), 936 states have internal predecessors, (1354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1290 states. [2022-04-07 16:10:49,484 INFO L87 Difference]: Start difference. First operand has 941 states, 936 states have (on average 1.4465811965811965) internal successors, (1354), 936 states have internal predecessors, (1354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1290 states. [2022-04-07 16:10:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:49,524 INFO L93 Difference]: Finished difference Result 1290 states and 1857 transitions. [2022-04-07 16:10:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1857 transitions. [2022-04-07 16:10:49,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:49,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:49,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:49,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 936 states have (on average 1.4465811965811965) internal successors, (1354), 936 states have internal predecessors, (1354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1358 transitions. [2022-04-07 16:10:49,553 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1358 transitions. Word has length 171 [2022-04-07 16:10:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:49,554 INFO L478 AbstractCegarLoop]: Abstraction has 941 states and 1358 transitions. [2022-04-07 16:10:49,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1358 transitions. [2022-04-07 16:10:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-07 16:10:49,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:49,555 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:49,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 16:10:49,556 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1837109397, now seen corresponding path program 1 times [2022-04-07 16:10:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:49,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538986439] [2022-04-07 16:10:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:49,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {58893#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {58886#true} is VALID [2022-04-07 16:10:49,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {58886#true} assume true; {58886#true} is VALID [2022-04-07 16:10:49,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58886#true} {58886#true} #593#return; {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {58886#true} call ULTIMATE.init(); {58893#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:49,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {58893#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {58886#true} assume true; {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58886#true} {58886#true} #593#return; {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {58886#true} call #t~ret158 := main(); {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {58886#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; {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {58886#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {58886#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {58886#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {58886#true} is VALID [2022-04-07 16:10:49,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {58886#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {58886#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {58886#true} assume !false; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {58886#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {58886#true} assume 12292 == #t~mem49;havoc #t~mem49; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {58886#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {58886#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {58886#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {58886#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {58886#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {58886#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {58886#true} assume !(0 == ~tmp___4~0); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {58886#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {58886#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {58886#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {58886#true} ~skip~0 := 0; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {58886#true} assume !false; {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {58886#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {58886#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {58886#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {58886#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {58886#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {58886#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {58886#true} assume 4368 == #t~mem54;havoc #t~mem54; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {58886#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {58886#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {58886#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {58886#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {58886#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {58886#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {58886#true} ~skip~0 := 0; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {58886#true} assume !false; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {58886#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {58886#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {58886#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {58886#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {58886#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {58886#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {58886#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {58886#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {58886#true} assume 4384 == #t~mem56;havoc #t~mem56; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {58886#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58886#true} is VALID [2022-04-07 16:10:49,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {58886#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {58886#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {58886#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {58886#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {58886#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {58886#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {58886#true} ~skip~0 := 0; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {58886#true} assume !false; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {58886#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {58886#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {58886#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {58886#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {58886#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {58886#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {58886#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {58886#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {58886#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {58886#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {58886#true} assume 4400 == #t~mem58;havoc #t~mem58; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {58886#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {58886#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {58886#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {58886#true} is VALID [2022-04-07 16:10:49,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {58886#true} assume !(~ret~0 <= 0); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {58886#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {58886#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {58886#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {58886#true} ~skip~0 := 0; {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 78: Hoare triple {58886#true} assume !false; {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 79: Hoare triple {58886#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {58886#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {58886#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {58886#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {58886#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {58886#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {58886#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {58886#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 87: Hoare triple {58886#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {58886#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {58886#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {58886#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 91: Hoare triple {58886#true} assume 4416 == #t~mem60;havoc #t~mem60; {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 92: Hoare triple {58886#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {58886#true} is VALID [2022-04-07 16:10:49,721 INFO L290 TraceCheckUtils]: 93: Hoare triple {58886#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {58886#true} is VALID [2022-04-07 16:10:49,722 INFO L290 TraceCheckUtils]: 94: Hoare triple {58886#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); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,723 INFO L290 TraceCheckUtils]: 96: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,723 INFO L290 TraceCheckUtils]: 97: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,723 INFO L290 TraceCheckUtils]: 98: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,724 INFO L290 TraceCheckUtils]: 99: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,724 INFO L290 TraceCheckUtils]: 100: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,724 INFO L290 TraceCheckUtils]: 101: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,724 INFO L290 TraceCheckUtils]: 102: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,724 INFO L290 TraceCheckUtils]: 103: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,725 INFO L290 TraceCheckUtils]: 104: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,725 INFO L290 TraceCheckUtils]: 105: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,725 INFO L290 TraceCheckUtils]: 106: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,725 INFO L290 TraceCheckUtils]: 107: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 108: Hoare triple {58891#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {58892#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 109: Hoare triple {58892#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 110: Hoare triple {58887#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 111: Hoare triple {58887#false} assume !(1 == ~blastFlag~0); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 112: Hoare triple {58887#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 113: Hoare triple {58887#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 114: Hoare triple {58887#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 115: Hoare triple {58887#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 116: Hoare triple {58887#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 117: Hoare triple {58887#false} ~skip~0 := 0; {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 118: Hoare triple {58887#false} assume !false; {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 119: Hoare triple {58887#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 120: Hoare triple {58887#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 121: Hoare triple {58887#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 122: Hoare triple {58887#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,726 INFO L290 TraceCheckUtils]: 123: Hoare triple {58887#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 124: Hoare triple {58887#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 125: Hoare triple {58887#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 126: Hoare triple {58887#false} assume 4369 == #t~mem55;havoc #t~mem55; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 127: Hoare triple {58887#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 128: Hoare triple {58887#false} assume !(0 == ~blastFlag~0); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 129: Hoare triple {58887#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 130: Hoare triple {58887#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 131: Hoare triple {58887#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 132: Hoare triple {58887#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 133: Hoare triple {58887#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 134: Hoare triple {58887#false} ~skip~0 := 0; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 135: Hoare triple {58887#false} assume !false; {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 136: Hoare triple {58887#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 137: Hoare triple {58887#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 138: Hoare triple {58887#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 139: Hoare triple {58887#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 140: Hoare triple {58887#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 141: Hoare triple {58887#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 142: Hoare triple {58887#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 143: Hoare triple {58887#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,727 INFO L290 TraceCheckUtils]: 144: Hoare triple {58887#false} assume 4384 == #t~mem56;havoc #t~mem56; {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 145: Hoare triple {58887#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 146: Hoare triple {58887#false} assume !(1 == ~blastFlag~0); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 147: Hoare triple {58887#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 148: Hoare triple {58887#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 149: Hoare triple {58887#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 150: Hoare triple {58887#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 151: Hoare triple {58887#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 152: Hoare triple {58887#false} ~skip~0 := 0; {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 153: Hoare triple {58887#false} assume !false; {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 154: Hoare triple {58887#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 155: Hoare triple {58887#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 156: Hoare triple {58887#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 157: Hoare triple {58887#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 158: Hoare triple {58887#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 159: Hoare triple {58887#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 160: Hoare triple {58887#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 161: Hoare triple {58887#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 162: Hoare triple {58887#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 163: Hoare triple {58887#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 164: Hoare triple {58887#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 165: Hoare triple {58887#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,728 INFO L290 TraceCheckUtils]: 166: Hoare triple {58887#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,729 INFO L290 TraceCheckUtils]: 167: Hoare triple {58887#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {58887#false} is VALID [2022-04-07 16:10:49,729 INFO L290 TraceCheckUtils]: 168: Hoare triple {58887#false} assume 4432 == #t~mem62;havoc #t~mem62; {58887#false} is VALID [2022-04-07 16:10:49,729 INFO L290 TraceCheckUtils]: 169: Hoare triple {58887#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {58887#false} is VALID [2022-04-07 16:10:49,729 INFO L290 TraceCheckUtils]: 170: Hoare triple {58887#false} assume 5 == ~blastFlag~0; {58887#false} is VALID [2022-04-07 16:10:49,729 INFO L290 TraceCheckUtils]: 171: Hoare triple {58887#false} assume !false; {58887#false} is VALID [2022-04-07 16:10:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-07 16:10:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:49,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538986439] [2022-04-07 16:10:49,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538986439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:49,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:49,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894302599] [2022-04-07 16:10:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:49,730 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 172 [2022-04-07 16:10:49,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:49,730 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-07 16:10:49,797 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-07 16:10:49,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:49,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:49,799 INFO L87 Difference]: Start difference. First operand 941 states and 1358 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-07 16:10:51,821 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-07 16:10:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:52,823 INFO L93 Difference]: Finished difference Result 2235 states and 3235 transitions. [2022-04-07 16:10:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:52,823 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 172 [2022-04-07 16:10:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:52,824 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-07 16:10:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:52,825 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-07 16:10:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:10:52,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-07 16:10:53,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:53,185 INFO L225 Difference]: With dead ends: 2235 [2022-04-07 16:10:53,185 INFO L226 Difference]: Without dead ends: 1310 [2022-04-07 16:10:53,186 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-07 16:10:53,186 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 110 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:53,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-04-07 16:10:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 956. [2022-04-07 16:10:53,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:53,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1310 states. Second operand has 956 states, 951 states have (on average 1.444794952681388) internal successors, (1374), 951 states have internal predecessors, (1374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,203 INFO L74 IsIncluded]: Start isIncluded. First operand 1310 states. Second operand has 956 states, 951 states have (on average 1.444794952681388) internal successors, (1374), 951 states have internal predecessors, (1374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,203 INFO L87 Difference]: Start difference. First operand 1310 states. Second operand has 956 states, 951 states have (on average 1.444794952681388) internal successors, (1374), 951 states have internal predecessors, (1374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:53,245 INFO L93 Difference]: Finished difference Result 1310 states and 1887 transitions. [2022-04-07 16:10:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1887 transitions. [2022-04-07 16:10:53,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:53,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:53,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 956 states, 951 states have (on average 1.444794952681388) internal successors, (1374), 951 states have internal predecessors, (1374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1310 states. [2022-04-07 16:10:53,247 INFO L87 Difference]: Start difference. First operand has 956 states, 951 states have (on average 1.444794952681388) internal successors, (1374), 951 states have internal predecessors, (1374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1310 states. [2022-04-07 16:10:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:53,289 INFO L93 Difference]: Finished difference Result 1310 states and 1887 transitions. [2022-04-07 16:10:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1887 transitions. [2022-04-07 16:10:53,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:53,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:53,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:53,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 951 states have (on average 1.444794952681388) internal successors, (1374), 951 states have internal predecessors, (1374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1378 transitions. [2022-04-07 16:10:53,318 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1378 transitions. Word has length 172 [2022-04-07 16:10:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:53,318 INFO L478 AbstractCegarLoop]: Abstraction has 956 states and 1378 transitions. [2022-04-07 16:10:53,318 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-07 16:10:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1378 transitions. [2022-04-07 16:10:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-07 16:10:53,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:53,320 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:53,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 16:10:53,320 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -68628705, now seen corresponding path program 1 times [2022-04-07 16:10:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:53,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557328154] [2022-04-07 16:10:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:53,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:53,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {65118#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {65111#true} is VALID [2022-04-07 16:10:53,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {65111#true} assume true; {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65111#true} {65111#true} #593#return; {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {65111#true} call ULTIMATE.init(); {65118#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:53,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {65118#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {65111#true} assume true; {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65111#true} {65111#true} #593#return; {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {65111#true} call #t~ret158 := main(); {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {65111#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; {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {65111#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {65111#true} is VALID [2022-04-07 16:10:53,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {65111#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {65111#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {65111#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {65111#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {65111#true} assume !false; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {65111#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {65111#true} assume 12292 == #t~mem49;havoc #t~mem49; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {65111#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {65111#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {65111#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {65111#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {65111#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {65111#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {65111#true} assume !(0 == ~tmp___4~0); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {65111#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {65111#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {65111#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {65111#true} ~skip~0 := 0; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {65111#true} assume !false; {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {65111#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {65111#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {65111#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {65111#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {65111#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {65111#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {65111#true} assume 4368 == #t~mem54;havoc #t~mem54; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {65111#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {65111#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {65111#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {65111#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {65111#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {65111#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {65111#true} ~skip~0 := 0; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {65111#true} assume !false; {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {65111#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {65111#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {65111#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {65111#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {65111#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {65111#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {65111#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {65111#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {65111#true} assume 4384 == #t~mem56;havoc #t~mem56; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {65111#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {65111#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {65111#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {65111#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {65111#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {65111#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {65111#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {65111#true} ~skip~0 := 0; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {65111#true} assume !false; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {65111#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {65111#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {65111#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {65111#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {65111#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {65111#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {65111#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {65111#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {65111#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {65111#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {65111#true} assume 4400 == #t~mem58;havoc #t~mem58; {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {65111#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,484 INFO L290 TraceCheckUtils]: 71: Hoare triple {65111#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {65111#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {65111#true} assume !(~ret~0 <= 0); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {65111#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 75: Hoare triple {65111#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {65111#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {65111#true} ~skip~0 := 0; {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {65111#true} assume !false; {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {65111#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 80: Hoare triple {65111#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 81: Hoare triple {65111#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 82: Hoare triple {65111#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 83: Hoare triple {65111#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 84: Hoare triple {65111#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 85: Hoare triple {65111#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 86: Hoare triple {65111#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 87: Hoare triple {65111#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 88: Hoare triple {65111#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 89: Hoare triple {65111#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {65111#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 91: Hoare triple {65111#true} assume 4416 == #t~mem60;havoc #t~mem60; {65111#true} is VALID [2022-04-07 16:10:53,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {65111#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {65111#true} is VALID [2022-04-07 16:10:53,486 INFO L290 TraceCheckUtils]: 93: Hoare triple {65111#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {65111#true} is VALID [2022-04-07 16:10:53,486 INFO L290 TraceCheckUtils]: 94: Hoare triple {65111#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); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,487 INFO L290 TraceCheckUtils]: 95: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,487 INFO L290 TraceCheckUtils]: 96: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,487 INFO L290 TraceCheckUtils]: 97: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,487 INFO L290 TraceCheckUtils]: 98: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,487 INFO L290 TraceCheckUtils]: 99: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,488 INFO L290 TraceCheckUtils]: 100: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,488 INFO L290 TraceCheckUtils]: 101: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,488 INFO L290 TraceCheckUtils]: 102: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,489 INFO L290 TraceCheckUtils]: 105: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,489 INFO L290 TraceCheckUtils]: 106: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,489 INFO L290 TraceCheckUtils]: 107: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 109: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 110: Hoare triple {65116#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65117#(= |ssl3_connect_#t~mem59| 4432)} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 111: Hoare triple {65117#(= |ssl3_connect_#t~mem59| 4432)} assume 4401 == #t~mem59;havoc #t~mem59; {65112#false} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 112: Hoare triple {65112#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 113: Hoare triple {65112#false} assume 0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296;havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;~skip~0 := 1; {65112#false} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 114: Hoare triple {65112#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,490 INFO L290 TraceCheckUtils]: 115: Hoare triple {65112#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 116: Hoare triple {65112#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 117: Hoare triple {65112#false} ~skip~0 := 0; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 118: Hoare triple {65112#false} assume !false; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 119: Hoare triple {65112#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 120: Hoare triple {65112#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 121: Hoare triple {65112#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 122: Hoare triple {65112#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 123: Hoare triple {65112#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 124: Hoare triple {65112#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 125: Hoare triple {65112#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 126: Hoare triple {65112#false} assume 4369 == #t~mem55;havoc #t~mem55; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 127: Hoare triple {65112#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 128: Hoare triple {65112#false} assume !(0 == ~blastFlag~0); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 129: Hoare triple {65112#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 130: Hoare triple {65112#false} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 131: Hoare triple {65112#false} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 132: Hoare triple {65112#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 133: Hoare triple {65112#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 134: Hoare triple {65112#false} ~skip~0 := 0; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 135: Hoare triple {65112#false} assume !false; {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 136: Hoare triple {65112#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,491 INFO L290 TraceCheckUtils]: 137: Hoare triple {65112#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 138: Hoare triple {65112#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 139: Hoare triple {65112#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 140: Hoare triple {65112#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 141: Hoare triple {65112#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 142: Hoare triple {65112#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 143: Hoare triple {65112#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 144: Hoare triple {65112#false} assume 4384 == #t~mem56;havoc #t~mem56; {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 145: Hoare triple {65112#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 146: Hoare triple {65112#false} assume !(1 == ~blastFlag~0); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 147: Hoare triple {65112#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 148: Hoare triple {65112#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 149: Hoare triple {65112#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 150: Hoare triple {65112#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 151: Hoare triple {65112#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 152: Hoare triple {65112#false} ~skip~0 := 0; {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 153: Hoare triple {65112#false} assume !false; {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 154: Hoare triple {65112#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 155: Hoare triple {65112#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 156: Hoare triple {65112#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 157: Hoare triple {65112#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,492 INFO L290 TraceCheckUtils]: 158: Hoare triple {65112#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 159: Hoare triple {65112#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 160: Hoare triple {65112#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 161: Hoare triple {65112#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 162: Hoare triple {65112#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 163: Hoare triple {65112#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 164: Hoare triple {65112#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 165: Hoare triple {65112#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 166: Hoare triple {65112#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 167: Hoare triple {65112#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 168: Hoare triple {65112#false} assume 4432 == #t~mem62;havoc #t~mem62; {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 169: Hoare triple {65112#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 170: Hoare triple {65112#false} assume 5 == ~blastFlag~0; {65112#false} is VALID [2022-04-07 16:10:53,493 INFO L290 TraceCheckUtils]: 171: Hoare triple {65112#false} assume !false; {65112#false} is VALID [2022-04-07 16:10:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-07 16:10:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:53,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557328154] [2022-04-07 16:10:53,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557328154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:53,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:53,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655687136] [2022-04-07 16:10:53,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:53,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2022-04-07 16:10:53,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:53,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:53,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:53,569 INFO L87 Difference]: Start difference. First operand 956 states and 1378 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:55,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:10:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:56,764 INFO L93 Difference]: Finished difference Result 2098 states and 3039 transitions. [2022-04-07 16:10:56,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2022-04-07 16:10:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-07 16:10:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-07 16:10:56,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-07 16:10:57,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:57,067 INFO L225 Difference]: With dead ends: 2098 [2022-04-07 16:10:57,067 INFO L226 Difference]: Without dead ends: 1158 [2022-04-07 16:10:57,068 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-07 16:10:57,069 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 69 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:57,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 525 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 477 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-04-07 16:10:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 968. [2022-04-07 16:10:57,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:57,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1158 states. Second operand has 968 states, 963 states have (on average 1.439252336448598) internal successors, (1386), 963 states have internal predecessors, (1386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,094 INFO L74 IsIncluded]: Start isIncluded. First operand 1158 states. Second operand has 968 states, 963 states have (on average 1.439252336448598) internal successors, (1386), 963 states have internal predecessors, (1386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,095 INFO L87 Difference]: Start difference. First operand 1158 states. Second operand has 968 states, 963 states have (on average 1.439252336448598) internal successors, (1386), 963 states have internal predecessors, (1386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:57,128 INFO L93 Difference]: Finished difference Result 1158 states and 1677 transitions. [2022-04-07 16:10:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1677 transitions. [2022-04-07 16:10:57,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:57,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:57,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 968 states, 963 states have (on average 1.439252336448598) internal successors, (1386), 963 states have internal predecessors, (1386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1158 states. [2022-04-07 16:10:57,131 INFO L87 Difference]: Start difference. First operand has 968 states, 963 states have (on average 1.439252336448598) internal successors, (1386), 963 states have internal predecessors, (1386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1158 states. [2022-04-07 16:10:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:57,164 INFO L93 Difference]: Finished difference Result 1158 states and 1677 transitions. [2022-04-07 16:10:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1677 transitions. [2022-04-07 16:10:57,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:57,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:57,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:57,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 963 states have (on average 1.439252336448598) internal successors, (1386), 963 states have internal predecessors, (1386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1390 transitions. [2022-04-07 16:10:57,193 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1390 transitions. Word has length 172 [2022-04-07 16:10:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:57,194 INFO L478 AbstractCegarLoop]: Abstraction has 968 states and 1390 transitions. [2022-04-07 16:10:57,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1390 transitions. [2022-04-07 16:10:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-07 16:10:57,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:57,195 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:57,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 16:10:57,196 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 506446570, now seen corresponding path program 1 times [2022-04-07 16:10:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:57,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068232428] [2022-04-07 16:10:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:57,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:57,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {70886#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70876#true} is VALID [2022-04-07 16:10:57,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {70876#true} assume true; {70876#true} is VALID [2022-04-07 16:10:57,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70876#true} {70876#true} #593#return; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {70876#true} call ULTIMATE.init(); {70886#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-07 16:10:57,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {70886#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {70876#true} assume true; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70876#true} {70876#true} #593#return; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {70876#true} call #t~ret158 := main(); {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {70876#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; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {70876#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {70876#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {70876#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {70876#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {70876#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {70876#true} assume 12292 == #t~mem49;havoc #t~mem49; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {70876#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {70876#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {70876#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {70876#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {70876#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {70876#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {70876#true} assume !(0 == ~tmp___4~0); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {70876#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {70876#true} assume 4368 == #t~mem54;havoc #t~mem54; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {70876#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {70876#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {70876#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {70876#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {70876#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {70876#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {70876#true} assume 4384 == #t~mem56;havoc #t~mem56; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {70876#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {70876#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {70876#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {70876#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {70876#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {70876#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {70876#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {70876#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {70876#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {70876#true} assume 4400 == #t~mem58;havoc #t~mem58; {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {70876#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {70876#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {70876#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70876#true} is VALID [2022-04-07 16:10:57,467 INFO L290 TraceCheckUtils]: 73: Hoare triple {70876#true} assume !(~ret~0 <= 0); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {70876#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 76: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 78: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 79: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 82: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 83: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 84: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 85: Hoare triple {70876#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {70876#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 87: Hoare triple {70876#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {70876#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {70876#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {70876#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 91: Hoare triple {70876#true} assume 4416 == #t~mem60;havoc #t~mem60; {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 92: Hoare triple {70876#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 93: Hoare triple {70876#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 94: Hoare triple {70876#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); {70876#true} is VALID [2022-04-07 16:10:57,468 INFO L290 TraceCheckUtils]: 95: Hoare triple {70876#true} assume !(0 == ~tmp___6~0); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 96: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 97: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 98: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 99: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 100: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 101: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 102: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 103: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 104: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {70876#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {70876#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 108: Hoare triple {70876#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,469 INFO L290 TraceCheckUtils]: 109: Hoare triple {70876#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70881#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:57,470 INFO L290 TraceCheckUtils]: 110: Hoare triple {70881#(= |ssl3_connect_#t~mem58| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70882#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,470 INFO L290 TraceCheckUtils]: 111: Hoare triple {70882#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70882#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,470 INFO L290 TraceCheckUtils]: 112: Hoare triple {70882#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {70882#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 113: Hoare triple {70882#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {70883#(not (= |ssl3_connect_#t~mem62| 4400))} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 114: Hoare triple {70883#(not (= |ssl3_connect_#t~mem62| 4400))} assume 4432 == #t~mem62;havoc #t~mem62; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 115: Hoare triple {70876#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 116: Hoare triple {70876#true} assume !(5 == ~blastFlag~0); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 117: Hoare triple {70876#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); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 118: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 119: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 120: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 121: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 122: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 123: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 124: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 127: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 128: Hoare triple {70876#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 129: Hoare triple {70876#true} assume 4369 == #t~mem55;havoc #t~mem55; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 130: Hoare triple {70876#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {70876#true} is VALID [2022-04-07 16:10:57,471 INFO L290 TraceCheckUtils]: 131: Hoare triple {70876#true} assume !(0 == ~blastFlag~0); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {70876#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {70876#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 134: Hoare triple {70876#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 135: Hoare triple {70876#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {70876#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 137: Hoare triple {70876#true} ~skip~0 := 0; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 138: Hoare triple {70876#true} assume !false; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 139: Hoare triple {70876#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 140: Hoare triple {70876#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 141: Hoare triple {70876#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 142: Hoare triple {70876#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 143: Hoare triple {70876#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 144: Hoare triple {70876#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 145: Hoare triple {70876#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 146: Hoare triple {70876#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 147: Hoare triple {70876#true} assume 4384 == #t~mem56;havoc #t~mem56; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 148: Hoare triple {70876#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 149: Hoare triple {70876#true} assume !(1 == ~blastFlag~0); {70876#true} is VALID [2022-04-07 16:10:57,472 INFO L290 TraceCheckUtils]: 150: Hoare triple {70876#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {70876#true} is VALID [2022-04-07 16:10:57,473 INFO L290 TraceCheckUtils]: 151: Hoare triple {70876#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,473 INFO L290 TraceCheckUtils]: 152: Hoare triple {70884#(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); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,474 INFO L290 TraceCheckUtils]: 153: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,474 INFO L290 TraceCheckUtils]: 154: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,474 INFO L290 TraceCheckUtils]: 155: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,474 INFO L290 TraceCheckUtils]: 156: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,475 INFO L290 TraceCheckUtils]: 157: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,475 INFO L290 TraceCheckUtils]: 158: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,475 INFO L290 TraceCheckUtils]: 159: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,475 INFO L290 TraceCheckUtils]: 160: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,475 INFO L290 TraceCheckUtils]: 161: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,476 INFO L290 TraceCheckUtils]: 162: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,476 INFO L290 TraceCheckUtils]: 163: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,476 INFO L290 TraceCheckUtils]: 164: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,476 INFO L290 TraceCheckUtils]: 165: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,476 INFO L290 TraceCheckUtils]: 166: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,477 INFO L290 TraceCheckUtils]: 167: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,477 INFO L290 TraceCheckUtils]: 168: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,477 INFO L290 TraceCheckUtils]: 169: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:57,477 INFO L290 TraceCheckUtils]: 170: Hoare triple {70884#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {70885#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-07 16:10:57,478 INFO L290 TraceCheckUtils]: 171: Hoare triple {70885#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {70877#false} is VALID [2022-04-07 16:10:57,478 INFO L290 TraceCheckUtils]: 172: Hoare triple {70877#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {70877#false} is VALID [2022-04-07 16:10:57,478 INFO L290 TraceCheckUtils]: 173: Hoare triple {70877#false} assume 5 == ~blastFlag~0; {70877#false} is VALID [2022-04-07 16:10:57,478 INFO L290 TraceCheckUtils]: 174: Hoare triple {70877#false} assume !false; {70877#false} is VALID [2022-04-07 16:10:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 105 proven. 5 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-07 16:10:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:57,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068232428] [2022-04-07 16:10:57,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068232428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:10:57,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519183529] [2022-04-07 16:10:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:57,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:10:57,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:10:57,480 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-07 16:10:57,481 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-07 16:10:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:58,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 16:10:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:10:58,417 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-07 16:10:58,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-07 16:10:58,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-07 16:10:58,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-07 16:10:58,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9